𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of some problems related to graph extensions

✍ Scribed by M. B. Abrosimov

Book ID
110149827
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
510 KB
Volume
88
Category
Article
ISSN
0001-4346

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.

On the complexity of graph tree partitio
On the complexity of graph tree partition problems
✍ Roberto Cordone; Francesco Maffioli πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati