On Minimum Connecting Transition Sets in Graphs
From MaRDI portal
Publication:6304514
DOI10.1007/978-3-030-00256-5_4zbMath1517.68272arXiv1807.08463MaRDI QIDQ6304514
Thomas Bellitto, Benjamin Bergougnoux
Publication date: 23 July 2018
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) Approximation algorithms (68W25)
This page was built for publication: On Minimum Connecting Transition Sets in Graphs