Drawing graphs with k vertices per face: Complexity and algorithms

A drawing Γ of a graph G divides the plane into topologically connected regions, called faces (or cells). The boundary of each face is formed by vertices, crossings, and edge portions. Given a positive integer k, we say that Γ is a k+-real face drawing of G if the boundary of each face of Γ contains...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 1058; s. 115576
Hlavní autori:	Bekos, Michael A., Di Battista, Giuseppe, Di Giacomo, Emilio, Didimo, Walter, Kaufmann, Michael, Montecchiani, Fabrizio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 22.12.2025
Predmet:	2-Layer drawings [formula omitted]-real face graphs Beyond-planar graph drawing NP-hardness Recognition algorithms Recognition algorithms NP-hardness Beyond-planar graph drawing k+-real face graphs 2-Layer drawings
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!