Linear MIM-Width of Trees
Abstract
We provide an O(n n) algorithm computing the linear maximum induced matching width of a tree and an optimal layout.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.