Covering graphs with few complete bipartite subgraphs.
Herbert FleischnerEgbert MujuniDaniël PaulusmaStefan SzeiderPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- graph mining
- graph databases
- graph model
- bipartite graph
- subgraph isomorphism
- graph structures
- labeled graphs
- graph properties
- subgraph matching
- graph partitioning
- undirected graph
- subgraph mining
- frequent subgraph mining
- real valued
- graph representation
- dense subgraphs
- maximum common subgraph
- directed graph
- graph theoretic
- maximal cliques
- graph patterns
- maximum clique
- reachability queries
- graph structure
- graph theory
- graph matching
- connected subgraphs
- data structure
- frequent subgraphs
- topological information
- graph data
- weighted graph