Planar linear arrangements of outerplanar graphs

DOI10.1109/31.1745zbMath0638.05020OpenAlexW2155126963MaRDI QIDQ3778778

Susanne E. Hambrusch, Greg N. Frederickson

Publication date: 1988

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1581&context=cstech

zbMATH Keywords

algorithmsbandwidthscheduling problemslayoutsn-vertex outerplanar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

Minimum Linear Arrangement of Series-Parallel Graphs ⋮ Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ Intersection representations of matrices by subtrees and unicycles on graphs ⋮ Lower and upper bounds for the linear arrangement problem on interval graphs ⋮ Unnamed Item ⋮ Optimal one-page tree embeddings in linear time ⋮ On minimum cuts and the linear arrangement problem ⋮ Bounds of the sum of edge lengths in linear arrangements of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees

This page was built for publication: Planar linear arrangements of outerplanar graphs