Complexity and algorithms for constant diameter augmentation problems
From MaRDI portal
Publication:6350295
DOI10.1016/j.tcs.2021.05.020zbMath1533.68244arXiv2010.00273MaRDI QIDQ6350295
Eun Jung Kim, Martin Milanič, Jérôme Monnot, Christophe Picouleau
Publication date: 1 October 2020
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Complexity and algorithms for constant diameter augmentation problems