External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Jan Bok

This author has not been identified. Look up 'Jan Bok' in Google

Jirí Fiala 0001

This author has not been identified. Look up 'Jirí Fiala 0001' in Google

Nikola Jedlicková

This author has not been identified. Look up 'Nikola Jedlicková' in Google

Jan Kratochvíl

This author has not been identified. Look up 'Jan Kratochvíl' in Google

Michaela Seifrtová

This author has not been identified. Look up 'Michaela Seifrtová' in Google
runs on