A note on maximal common subgraphs of the Dirac's family of graphs.
Jozef BuckoPeter MihókJean-François SacléMariusz WozniakPublished in: Discuss. Math. Graph Theory (2005)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- labeled graphs
- connected subgraphs
- graph properties
- maximum common subgraph
- graph structures
- reachability queries
- independent set
- subgraph mining
- maximum clique
- graph data
- graph matching
- frequent subgraph mining
- data structure
- frequent subgraphs
- topological information
- dense subgraphs
- special case
- maximal cliques
- graph theory
- graph construction
- graph theoretic
- random walk
- polynomial delay
- community discovery
- graph search
- query graph
- connected components
- random graphs
- structured data
- spanning tree
- weighted graph
- query language
- graph model