"On the Parameterized Complexity of Edge-Linked Paths."

Neeldhara Misra, Fahad Panolan, Saket Saurabh (2019)

Details and statistics

DOI: 10.1007/978-3-030-19955-5_25

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics