Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way. While structural and topological properties of RAC drawings hav...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph algorithms and applications Ročník 28; číslo 2; s. 131 - 150
Hlavní autori:	Brand, Cornelius, Ganian, Robert, Röder, Sebastian, Schager, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	06.11.2024
ISSN:	1526-1719, 1526-1719
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!