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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 87; H. 11; S. 1669 - 1709
Hauptverfasser:	Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2025 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!