Distance-2 Edge Coloring is NP-Complete
Jeff EricksonShripad ThiteDavid P. BundePublished in: CoRR (2005)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- distance measure
- pspace complete
- computational complexity
- edge information
- constraint satisfaction problems
- conjunctive queries
- bounded treewidth
- np complete problems
- edge detector
- euclidean distance
- edge detection
- data sources
- optimal solution
- database
- edge direction
- polynomial time complexity
- weighted graph
- special case
- similarity measure