×

Found 12 Documents (Results 1–12)

A linear-time parameterized algorithm for computing the width of a DAG. (English) Zbl 07538582

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 257-269 (2021).
MSC:  68R10

Graph searching games and width measures for directed graphs. (English) Zbl 1355.05168

Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 34-47 (2015).
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field