Enumerating minimal solution sets for metric graph problems

Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact in parameterized complexity by being the first known problems in NP to admit double-exponential lower bounds in the treewidth, and even in the vertex cover number for...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bergougnoux, Benjamin, Defrain, Oscar, Inerney, Fionn Mc
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!