A uniﬁed polynomial- time algorithm for feedback vertex set on graphs of bounded mim-width

Lars Jaﬀke, O-joung Kwon, Jan Arne Telle · 2018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.DS · 2019-07-09 · unverdicted · novelty 5.0

An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.

Showing 1 of 1 citing paper.

Linear MIM-Width of Trees cs.DS · 2019-07-09 · unverdicted · none · ref 15
An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.