Upward Book Embeddability of st-Graphs: Complexity and Algorithms

A k - page upward book embedding ( k UBE) of a directed acyclic graph G is a book embeddings of G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book. The k UBE Testing problem, which asks whether a graph admits a k UBE, was int...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 85; číslo 12; s. 3521 - 3571
Hlavní autori:	Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2023 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Apexes Combinatorial analysis Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Embedding Exponential functions Graph theory Graphs Mathematics of Computing Questions Theory of Computation SPQR-trees Branchwidth st-graphs Upward book embeddings Treewidth Sphere-cut decomposition
ISSN:	0178-4617, 1432-0541
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!