Divide-and-conquer algorithms for graph-layout problems

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-A" /><69::AID-NET1>3.0.CO;2-A 10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-AzbMath0864.90125OpenAlexW2063042204MaRDI QIDQ5689819

Ram Swaminathan

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a

zbMATH Keywords

decompositionbandwidthseries-parallel graphslinear-time algorithmscutwidthdivide-and-conquerpagenumbergraph-layout problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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