𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The set of minimal braids is co-NP-complete

✍ Scribed by M.S Paterson; A.A Razborov

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
835 KB
Volume
12
Category
Article
ISSN
0196-6774

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.