Linear MIM-width of trees

DOI10.1007/978-3-030-30786-8_17OpenAlexW2975291759MaRDI QIDQ2301545

Erlend Raa Vågset, Jan Arne Telle, Svein Høgemo

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1907.04132

zbMATH Keywords

exact algorithmsacyclic graphswidth parameterslinear MIM-width

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Solving problems on generalized convex graphs via mim-width ⋮ On the thinness of trees ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Solving problems on generalized convex graphs via mim-width

This page was built for publication: Linear MIM-width of trees