On covering graphs by complete bipartite subgraphs.
Stasys JuknaAlexander S. KulikovPublished in: Discret. Math. (2009)
Keyphrases
- graph model
- graph databases
- graph mining
- subgraph isomorphism
- bipartite graph
- graph partitioning
- graph properties
- subgraph matching
- reachability queries
- subgraph mining
- graph structures
- graph theoretic
- real valued
- labeled graphs
- undirected graph
- frequent subgraph mining
- maximal cliques
- maximum clique
- topological information
- maximum common subgraph
- graph data
- graph theory
- frequent subgraphs
- graph clustering
- graph representation
- complex structures
- graph matching
- data structure
- spanning tree
- dense subgraphs
- connected subgraphs