Partitioning H-minor free graphs into three subgraphs with no large components.
Chun-Hung LiuSang-il OumPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- labeled graphs
- frequent subgraph mining
- graph partitioning
- graph properties
- maximum common subgraph
- graph structures
- reachability queries
- connected subgraphs
- graph data
- graph clustering
- graph model
- graph matching
- topological information
- subgraph mining
- maximum clique
- frequent subgraphs
- building blocks
- query graph
- maximal cliques
- data structure
- graph search
- random graphs
- spanning tree
- dense subgraphs
- graph structure
- spectral graph
- bipartite graph