✦ LIBER ✦

The complexity of induced minors and related problems

✍ Scribed by M. R. Fellows; J. Kratochvil; M. Middendorf; F. Pfeiffer

Publisher: Springer
Year: 1995
Tongue: English
Weight: 882 KB
Volume: 13
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01190507

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of some problems in positive

Complexity of some problems in positive and related calculi

✍ L. Maksimova 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 256 KB

New Complexity Results on Array Contract

New Complexity Results on Array Contraction and Related Problems

✍ Darte, Alain ;Huard, Guillaume 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 786 KB

New pseudopolynomial complexity bounds f

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems

✍ Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 688 KB

The Complexity of König Subgraph Problem

The Complexity of König Subgraph Problems and

✍ Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar; C. R. Subramania 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 778 KB

A bound on the k-gonality of facets of t

A bound on the k-gonality of facets of the hypermetric cone and related complexity problems

✍ D. Avis; V.P. Grishukhin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 799 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.