On the simultaneous minimum spanning trees problem
From MaRDI portal
Publication:2636567
DOI10.1007/978-3-319-74180-2_20zbMath1497.68386arXiv1712.00253OpenAlexW2963077084MaRDI QIDQ2636567
Jakub Pekárek, Stanislav Kučera, Martin Smolík, Jana Novotná, Matěj Konečný, Martin Töpfer, Jakub Tětek
Publication date: 5 June 2018
Full work available at URL: https://arxiv.org/abs/1712.00253
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)
This page was built for publication: On the simultaneous minimum spanning trees problem