𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computing a longest path in a tree

✍ Scribed by R.W. Bulterman; F.W. van der Sommen; G. Zwaan; T. Verhoeff; A.J.M. van Gasteren; W.H.J. Feijen

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
37 KB
Volume
81
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on finding shortest path trees
A note on finding shortest path trees
✍ Aaron Kershenbaum πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 1 views
The optimal location of a path or tree i
The optimal location of a path or tree in a tree network
✍ Edward Minieka πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

This article describes methods for finding an optimal location for a path-shaped or tree-shaped facility of a specified size in a tree network. Four optimization criteria are examined: minimizing distancesum, minimizing eccentricity, maximizing distancesum, and maximizing eccentricity.

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.