On the Parameterized Complexity of Eulerian Strong Component Arc Deletion

In this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure every strongly connected component of the resulting digraph is Eulerian. This problem is a natural extension of the Dire...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 87; číslo 11; s. 1669 - 1709
Hlavní autori:	Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2025 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Graph theory Lower bounds Mathematics of Computing Parameterization Parameters Theory of Computation Eulerian graphs Parameterized complexity Treewidth
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!