Divide-and-conquer algorithms for graph-layout problems

DOI10.1002/(SICI)1097-0037(199609)28:2%3C69::AID-NET1%3E3.0.CO;2-AMaRDI QIDQ5689819zbMATH OpenOpenAlexFDO

Authors R. Swaminathan

Publication date 7 January 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199609)28:2%3C69::aid-net1%3E3.0.co;2-a

zbMATH Keywords

bandwidthcutwidthdecompositiondivide-and-conquergraph-layout problemslinear-time algorithmspagenumberseries-parallel graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3858434
• Planar linear arrangements of outerplanar graphs
• scientific article; zbMATH DE number 4128415
• Parallel algorithms for series parallel graphs and graphs with treewidth two

This page was built for publication: Divide-and-conquer algorithms for graph-layout problems

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