On the Edge-Length Ratio of 2-Trees

DOI10.1007/978-3-030-68766-3_7OpenAlexW3135568625MaRDI QIDQ5014107FDOQ5014107

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar Embeddings of Graphs with Specified Edge Lengths
• On the planar edge-length ratio of planar graphs
• The complexity of minimizing wire lengths in VLSI layouts
• Fixed edge-length graph drawing is NP-hard
• On the edge-length ratio of outerplanar graphs

Cited In (3)

• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
• Planar straight-line realizations of 2-trees with prescribed edge lengths
• On Edge-Length Ratios of Partial 2-Trees

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)