×

zbMATH — the first resource for mathematics

Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. (English) Zbl 0852.68072

MSC:
68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
05C78 Graph labelling (graceful graphs, bandwidth, etc.)
05C85 Graph algorithms (graph-theoretic aspects)
03D15 Complexity of computation (including implicit computational complexity)
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
68U99 Computing methodologies and applications
PDF BibTeX XML Cite
Full Text: DOI