Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
Zihong TianYanke DuQingde KangPublished in: Ars Comb. (2006)
Keyphrases
- weighted graph
- subgraph isomorphism
- labeled graphs
- undirected graph
- connected subgraphs
- edge weights
- graph mining
- directed edges
- query graph
- directed graph
- vertex set
- directed acyclic graph
- spanning tree
- maximal cliques
- subgraph mining
- real world graphs
- graph databases
- densely connected
- maximum common subgraph
- frequent subgraph mining
- graph clustering
- minimum weight
- random graphs
- graph matching
- graph data
- graph structure
- shortest path
- graph properties
- graph partitioning
- adjacency matrix
- attributed graphs
- bipartite graph
- graph structures
- connected components
- similarity function
- reachability queries
- data objects
- subgraph matching
- dense subgraphs
- maximum clique
- approximation algorithms
- hamiltonian cycle
- graph theory
- graph model
- edge detector
- edge map
- biological networks
- random walk