A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

DOI10.1016/0020-0190(93)90206-OzbMath0770.68056OpenAlexW2068076324MaRDI QIDQ1802068

Yaron Wolfsthal, Dafna Sheinwald, Fillia Makedon

Publication date: 8 August 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90206-o

zbMATH Keywords

bandwidthVLSI layoutgraph recognition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On bandwidth-2 graphs

Cites Work

• Two-page book embedding of trees under vertex-neighborhood constraints
• Flit-serial packet routing on meshes and tori
• Complexity Results for Bandwidth Minimization
• One-Page Book Embedding under Vertex-Neighborhood Constraints
• Unnamed Item

This page was built for publication: A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs