On the Edge-Length Ratio of 2-Trees

DOI10.1007/978-3-030-68766-3_7MaRDI QIDQ5014107zbMATH OpenOpenAlexFDO

Authors Václav Blažej, Jiří Fiala, Giuseppe Liotta

Publication date 1 December 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.11152

zbMATH Keywords

2-treeplanar straight-line drawingedge-length ratio

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• Fixed edge-length graph drawing is NP-hard
• Handbook of graph drawing and visualization
• On the planar edge-length ratio of planar graphs
• Planar Embeddings of Graphs with Specified Edge Lengths
• The complexity of minimizing wire lengths in VLSI layouts

Cited in

(6)

• Bounds on the edge-length ratio of 2-outerplanar graphs
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
• On edge-length ratios of partial 2-trees
• Weakly leveled planarity with bounded span
• Planar straight-line realizations of 2-trees with prescribed edge lengths
• Weakly leveled planarity with bounded span

This page was built for publication: On the Edge-Length Ratio of 2-Trees

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