The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge

Journal title: 31st International Symposium on Algorithms and Computation, ISAAC 2020

Journal number: 181

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Published year: 2020

Published pages: 59:1--59:15

DOI identifier: 10.4230/lipics.isaac.2020.59