Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
Jérôme MonnotVangelis Th. PaschosDominique de WerraMarc DemangeBruno EscoffierPublished in: ISAAC (2004)
Keyphrases
- graph model
- bipartite graph
- approximation error
- weight function
- decision problems
- weighted graph
- increase in computational complexity
- graph representation
- approximation algorithms
- computational complexity
- error tolerance
- planar graphs
- graph partitioning
- undirected graph
- closed form
- space complexity
- bounded treewidth
- error bounds
- computational cost
- graph mining
- worst case
- edge weights
- scheduling problem
- real valued
- spectral graph
- graph matching