Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of G to a polygonal chain consisting of horizontal and vertical segments. A longstanding open...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 85; číslo 9; s. 2605 - 2666
Hlavní autoři:	Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, Ortali, Giacomo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2023 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Bends Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Mathematics of Computing Questions Theory of Computation Plane graphs Bend minimization Series–parallel graphs Linear-time algorithms Orthogonal drawings
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!