New exact values of the maximum size of graphs free of topological complete subgraphs.
Camino BalbuenaMartín CeraAna DiánezPedro García-VázquezPublished in: Discret. Math. (2007)
Keyphrases
- maximum clique
- maximal cliques
- topological information
- graph mining
- maximum number
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- standard deviation
- computational complexity
- connected subgraphs
- maximum common subgraph
- data structure
- subgraph mining
- labeled graphs
- graph theoretic
- topological properties
- graph theory
- directed graph
- connected components
- graph structures
- association graph
- graph structure
- graph matching
- frequent subgraph mining
- reachability queries
- branch and bound algorithm
- reeb graph
- np hard