Article dans une revue, GALaC, Informatique

Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination

Olivier Hudry, Antoine Lobstein. Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination. Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, 2019, 110, pp.217-240. ⟨hal-01613388⟩

Publié le