# Linear MIM-Width of Trees

## TL;DR

This paper presents an efficient algorithm for computing the linear maximum induced matching width of trees, improving understanding of tree layouts and graph parameters.

## Contribution

It introduces an $O(n \,\log\, n)$ algorithm for calculating the linear MIM-width of trees and finding an optimal layout.

## Key findings

- Algorithm runs in $O(n \log n)$ time
- Provides an optimal layout for trees based on MIM-width
- Advances computational methods for graph width parameters

## Abstract

We provide an $O(n \log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout.