✦ 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
DOI: 10.1016/j.laa.2010.06.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Graph Related to Conjugacy Classes of

✍ G. Alfandary 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 247 KB

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 Diameter of a Graph Related to p-

On the Diameter of a Graph Related to p-Regular Conjugacy Classes of Finite Groups

✍ Ziqun Lu; Jiping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 77 KB

A note on the half-integral multiflow-pr

A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs

✍ Frank Pfeiffer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Complexity of a class of nonlinear combi

Complexity of a class of nonlinear combinatorial problems related to their linear counterparts

✍ Suresh P. Sethi; Wieslaw Kubiak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Numerical methods for a class of problem

Numerical methods for a class of problems of optimal flow control on graphs

✍ N.S. Vasil'ev 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 258 KB