Exact and Approximate Digraph Bandwidth

In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of the directed variants of the classical Cutwidth and Pathwidth problems, we def...

Celý popis

Podrobná bibliografie

Vydáno v:	Theory of computing systems Ročník 69; číslo 1; s. 10
Hlavní autoři:	Jain, Pallavi, Kanesh, Lawqueen, Lochet, Willian, Saurabh, Saket, Sharma, Roohani
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2025 Springer Nature B.V
Témata:	Algorithms Apexes Bandwidths Computer Science Graph theory Graphs Theory of Computation Approximation scheme Exact exponential algorithms Directed bandwidth
ISSN:	1432-4350, 1433-0490
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!