|
Enumerating minimal solution sets for metric graph problems| title | Enumerating minimal solution sets for metric graph problems |
|---|
| start_date | 2023/10/23 |
|---|
| schedule | 10h |
|---|
| online | no |
|---|
| location_info | lieu non précisé |
|---|
| details | Séminaire ACRO |
|---|
| summary | Problems from metric graph theory such as Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact on the field of parameterized complexity by being the first problems in NP to admit double-exponential lower bounds in the treewidth, and even in the vertex cover number for the latter. We initiate the study of enumerating minimal solution sets for these problems and show that they are also of great interest in enumeration. More specifically, we show that enumerating minimal resolving sets in graphs and minimal geodetic sets in split graphs are equivalent to hypergraph dualization, arguably one of the most important open problems in algorithmic enumeration. This provides two new natural examples to a question that emerged in different works this last decade: for which vertex (or edge) set graph property Π is the enumeration of minimal (or maximal) subsets satisfying Π equivalent to hypergraph dualization? As only very few properties are known to fit within this context---namely, properties related to minimal domination---our results make significant progress in characterizing such properties, and provide new angles of approach for tackling hypergraph dualization. In a second step, we consider cases where our reductions do not apply, namely graphs with no long induced paths, and show these cases to be mainly tractable. |
|---|
| responsibles | NC |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2023/10/19 13:46 UTC |
| |
|