Parameterized Complexity of Min-Power Asymmetric Connectivity

Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity. In Charles J. Colbourn, Roberto Grossi, Nadia Pisanti, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Volume 11638 of Lecture Notes in Computer Science, pages 85-96, Springer, 2019. [doi]

Abstract

Abstract is missing.