๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a class of metrics related to graph layout problems

โœ Scribed by Adam N. Letchford; Gerhard Reinelt; Hanna Seitz; Dirk Oliver Theis


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
296 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on the complexity of longest path
โœ 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.