Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
Manoel B. CampêloSulamita KleinPublished in: Discret. Appl. Math. (1998)
Keyphrases
- undirected graph
- maximum cardinality
- graph matching
- association graph
- minimum weight
- weighted graph
- directed graph
- bipartite graph
- edge weights
- maximum weight
- bipartite graph matching
- matching algorithm
- attributed graphs
- spanning tree
- pattern matching
- total weight
- subgraph isomorphism
- graph structure
- maximal cliques
- spectral graph
- random graphs
- graph clustering
- vertex set
- graph mining
- labeled graphs
- betweenness centrality
- graph matching algorithm
- connected components
- complex networks
- image matching
- keypoints
- attributed relational graph
- graph partitioning
- minimum distance
- graph data
- graph theoretic
- social networks
- minimum cost
- graph model
- directed acyclic graph
- point sets
- pairwise
- object recognition