Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
Julia BöttcherMathias SchachtAnusch TarazPublished in: J. Comb. Theory, Ser. B (2008)
Keyphrases
- quasi cliques
- graph mining
- subgraph isomorphism
- graph databases
- graph structures
- subgraph matching
- graph data
- labeled graphs
- maximum common subgraph
- data structure
- topological information
- graph patterns
- graph properties
- maximal cliques
- graph matching
- directed graph
- small number
- graph clustering
- frequent subgraphs
- small size
- graph theoretic
- bipartite graph
- reachability queries
- subgraph mining
- pattern mining
- shortest path