FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models

DOI10.1007/978-3-319-75172-6_19zbMath1498.68216OpenAlexW2788276951MaRDI QIDQ1641125

Shinya Shiroshita, Tomoaki Ogasawara, Hiroshi Imai, Hidefumi Hiraishi

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_19

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

FPT algorithms to enumerate and count acyclic and totally cyclic orientations

This page was built for publication: FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models