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

DOI10.1016/0020-0190(93)90206-OzbMATH Open0770.68056OpenAlexW2068076324MaRDI QIDQ1802068FDOQ1802068

Authors: Fillia Makedon, Dafna Sheinwald, Yaron Wolfsthal 

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

Recommendations

• On bandwidth-2 graphs
• Testing Bandwidth k for k-Connected Graphs
• Bandwidth of Bipartite Permutation Graphs
• Finding the minimum bandwidth of an interval graph
• scientific article; zbMATH DE number 3914372

zbMATH Keywords

bandwidthVLSI layoutgraph recognition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complexity Results for Bandwidth Minimization
• One-Page Book Embedding under Vertex-Neighborhood Constraints
• Flit-serial packet routing on meshes and tori
• Two-page book embedding of trees under vertex-neighborhood constraints

Cited In (2)

• Testing Bandwidth k for k-Connected Graphs
• On bandwidth-2 graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802068)