An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.
Inapproximability of rank, clique, boolean, and maximum induced matching-widths under small set expansion hypothesis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear MIM-Width of Trees
An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.