Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

Fradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of tournaments. They argued that the class of digraphs of bounded independence number is structured enough to be exploited algorithmically. In this...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 7; s. 2065 - 2086
Hlavní autoři:	Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2023 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Arc cutting Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematics of Computing Parameterization Theory of Computation 05C20 68Q25 68W40 Optimal linear arrangement Directed feedback arc set Directed cutwidth 05C85 68R05 97K20 Bounded independence number digraph 97P20 Sub-exponential fixed-parameter tractable algorithms
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!