Hamiltonian cycles in spanning subgraphs of line graphs.
Hao LiWeihua HeWeihua YangYandong BaiPublished in: Discret. Appl. Math. (2016)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- labeled graphs
- graph structures
- reachability queries
- connected subgraphs
- graph data
- maximum common subgraph
- subgraph mining
- graph theoretic
- topological information
- dense subgraphs
- graph matching
- frequent subgraph mining
- query graph
- quasi cliques
- graph patterns
- directed graph
- frequent subgraphs
- line segments
- maximum clique
- graph theory
- maximal cliques
- graph search
- data structure
- graph kernels
- graph clustering
- biological networks
- weighted graph
- edit distance
- mining algorithm
- pattern mining
- structured data