Approximating maximum weight K-colorable subgraphs in chordal graphs.
Venkatesan T. ChakaravarthySambuddha RoyPublished in: Inf. Process. Lett. (2009)
Keyphrases
- maximum weight
- independent set
- weighted graph
- bipartite graph
- subgraph isomorphism
- minimum weight
- bipartite matching
- graph databases
- graph mining
- graph properties
- labeled graphs
- partial order
- connected subgraphs
- undirected graph
- reachability queries
- spanning tree
- maximum clique
- association graph
- graph structures
- np hard
- data structure
- bipartite graph matching
- frequent subgraphs
- graph theoretic
- graph data
- computational complexity
- maximal cliques
- minimum spanning tree
- graph matching
- connected components
- markov chain