𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ULTRASOUND CORNER TIPS FOR MINIMIZING THE “HAIR PROBLEM”

✍ Scribed by Raymond A. Huml

Book ID
111283243
Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
82 KB
Volume
35
Category
Article
ISSN
0196-3627

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.