Hamiltonian paths in spanning subgraphs of line graphs.
Weihua HeWeihua YangPublished in: Discret. Math. (2017)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- labeled graphs
- subgraph mining
- maximum common subgraph
- connected subgraphs
- reachability queries
- graph structures
- graph data
- graph matching
- dense subgraphs
- query graph
- shortest path
- maximum clique
- frequent subgraphs
- line segments
- graph theory
- frequent subgraph mining
- graph patterns
- graph theoretic
- data structure
- quasi cliques
- straight line segments
- weighted graph
- topological information
- graph search
- network analysis
- random graphs
- graph representation
- structured data
- graph partitioning