✦ LIBER ✦

The NP-Completeness of the bandwidth minimization problem

✍ Scribed by Ch. H. Papadimitriou

Publisher: Springer Vienna
Year: 1976
Tongue: English
Weight: 375 KB
Volume: 16
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02280884

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bandwidth minimization problem for c

The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete

✍ David Muradian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

In this paper, we show that the bandwidth minimization problem remains NP-complete for cyclic caterpillars with hair length 1. Cyclic caterpillars with hair length 1 are graphs in which the removal of all pendant vertices results in a simple cycle.

NP-Completeness of the linear complement

NP-Completeness of the linear complementarity problem

✍ S. J. Chung 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 283 KB

NP-completeness of the hamming salesman

NP-completeness of the hamming salesman problem

✍ Jarmo Ernvall; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 211 KB

Finding Exact Solutions to the Bandwidth

Finding Exact Solutions to the Bandwidth Minimization Problem

✍ W. Hackbusch; B. N. Khoromskij 📂 Article 📅 1999 🏛 Springer Vienna 🌐 English ⚖ 298 KB

The STO problem is NP-complete

✍ P. Krysta; L. Pacholski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We prove that the problem STO of deciding whether or not a finite set E of term equations is subject to occur-check is in NP. E is subject to occur-check if the execution of the Martelli-Montanari unification algorithm gives for input E a set E ∪ {x = t}, where t = x and x appears in t. Apt et al. (

The set of minimal braids is co-NP-compl

The set of minimal braids is co-NP-complete

✍ M.S Paterson; A.A Razborov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 835 KB