Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Jinquan XuPing LiZhengke MiaoKeke WangHong-Jian LaiPublished in: Int. J. Comput. Math. (2014)
Keyphrases
- graph matching
- small number
- connected graphs
- maximum number
- random graphs
- undirected graph
- subgraph isomorphism
- matching process
- bipartite graph
- maximum cardinality
- graph theoretic
- graph representation
- graph partitioning
- pattern matching
- graph mining
- graph theory
- data sets
- complex structures
- spanning tree
- feature matching
- weighted graph
- edge weights
- small fraction
- shortest path
- graph kernels
- polynomial time complexity
- directed graph
- computational complexity