Linear MIM-width of trees

DOI10.1007/978-3-030-30786-8_17MaRDI QIDQ2301545zbMATH OpenOpenAlexFDO

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

Publication date 24 February 2020

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

zbMATH Keywords

acyclic graphsexact algorithmslinear MIM-widthwidth parameters

Mathematics Subject Classification ID

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

Cited in

(7)

• On the thinness of trees
• Solving problems on generalized convex graphs via mim-width
• Classes of intersection digraphs with good algorithmic properties
• On the thinness of trees
• Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
• The proportion of trees that are linear
• Solving problems on generalized convex graphs via mim-width

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301545)