The matching polynomial of the path-tree of a complete graph.
Mingxu GuoHaiyan ChenPublished in: Discret. Appl. Math. (2024)
Keyphrases
- graph matching
- maximum weight
- tree matching
- root node
- spanning tree
- association graph
- graph structure
- tree shaped
- tree structure
- bounded degree
- hierarchical data structure
- matching algorithm
- solution path
- tree nodes
- minimum spanning tree
- maximum matching
- maximum cardinality
- bipartite graph
- graph theory
- random walk
- stable set
- pattern matching
- matching process
- graph theoretic
- shortest path problem
- clique tree
- shortest path
- weighted graph
- minimum cost path
- strongly connected
- path length
- feature points
- subgraph isomorphism
- edge weights
- graph representation
- image matching
- structured data
- bayesian networks
- multicast tree
- maximal cliques
- leaf nodes
- undirected graph
- attributed relational graph