𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of path problems in properly colored directed graphs

✍ Scribed by Donatella Granata, Behnam Behdani, Panos M. Pardalos

Book ID
118801986
Publisher
Springer US
Year
2011
Tongue
English
Weight
445 KB
Volume
24
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the complexity of longest path
A note on the complexity of longest path problems related to graph coloring
✍ P.M. Pardalos; A. Migdalas πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 194 KB

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem.