Complexity of approximation of 3-edge-coloring of graphs.
Martin KocholNad'a KrivonákováSilvia SmejováKatarína SrankováPublished in: Inf. Process. Lett. (2008)
Keyphrases
- approximation error
- weighted graph
- undirected graph
- error tolerance
- graph mining
- increase in computational complexity
- minimum spanning trees
- graph matching
- approximation algorithms
- closed form
- error bounds
- graph theoretic
- edge information
- bounded treewidth
- graph representation
- spanning tree
- computational cost
- decision problems
- edge detection
- worst case