Found 4 Documents (Results 1–4)
More applications of the \(d\)-neighbor equivalence: connectivity and acyclicity constraints. (English) Zbl 07525454
Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 17, 14 p. (2019).
MSC:
68Wxx
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width. (English) Zbl 1487.68180
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 42, 14 p. (2018).
Digraphs of bounded width. (English) Zbl 1407.05113
Bang-Jensen, Jørgen (ed.) et al., Classes of directed graphs. Cham: Springer. Springer Monogr. Math., 405-466 (2018).
MSC:
05C20
Filter Results by …
Document Type
- Journal Articles (1)
- Collection Articles (3)
all
top 5
Author
- Kwon, O. joung (3)
- Bergougnoux, Benjamin (2)
- Kanté, Mamadou Moustapha (2)
- Jaffke, Lars (1)
- Kreutzer, Stephan (1)
- Telle, Jan Arne (1)
