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ženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 12; s. 3521 - 3571
Hlavní autoři:	Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.12.2023 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!