On circular layouts∗

DOI10.1080/00207168808803629zbMath0658.68078OpenAlexW2074472204MaRDI QIDQ3806838

Erkki Maekinen

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803629

zbMATH Keywords

NP-completegraph drawingcircular cutwidth minimizationcircular dilation minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Two equivalent measures on weighted hypergraphs ⋮ On the degree of non-regularity of context-free languages ⋮ Unnamed Item ⋮ Crossing Minimisation Heuristics for 2-page Drawings

Cites Work

• Unnamed Item
• The complexity of drawing trees nicely
• Some simplified NP-complete graph problems
• On Some Variants of the Bandwidth Minimization Problem