Computational Complexity of Covering Disconnected Multigraphs

Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová. Computational Complexity of Covering Disconnected Multigraphs. In Evripidis Bampis, Aris Pagourtzis, editors, Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Volume 12867 of Lecture Notes in Computer Science, pages 85-99, Springer, 2021. [doi]

Abstract

Abstract is missing.