The Maximum k-Colorable Subgraph Problem for Chordal Graphs.
Mihalis YannakakisFanica GavrilPublished in: Inf. Process. Lett. (1987)
Keyphrases
- connected components
- graph mining
- undirected graph
- connected subgraphs
- graph databases
- graph data
- frequent subgraphs
- graph structures
- dense subgraphs
- subgraph isomorphism
- frequent subgraph mining
- subgraph mining
- graph classification
- graph patterns
- subgraph matching
- community discovery
- labeled graphs
- graph mining algorithms
- graph matching
- graph properties
- maximum clique
- maximum number
- query language
- functional modules
- graph theory