algorithmic complexity 1biconnected graphs 1fixed embedding 1partial drawing extension 1planar graphs 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.CG2026
Extending Biconnected Straight-Line Planar Drawings
Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5
The paper investigates the difficulty of extending a straight-line planar drawing of a biconnected subgraph to the whole graph, showing NP‑hardness in the variable‑embedding case a…
cs.CG2025
A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista +3
Several algorithms for the construction of orthogonal drawings of graphs, including those based on the Topology-Shape-Metrics (TSM) paradigm, tend to prioritize the minimization of…