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

Authors:
David Muradian
Affiliations:
HPLA L.L.C. 49/3 Komitas Ave., Yerevan 375051, Armenia
Venue:
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Year:
2003

Citing 5
Cited 0

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

SIAM Journal on Algebraic and Discrete Methods
A new basis for trades

SIAM Journal on Discrete Mathematics
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs

SIAM Journal on Discrete Mathematics
Bandwidth and density for block graphs

Discrete Mathematics
A survey of graph layout problems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.