pith. sign in

Title resolution pending

Petr A · 2018

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

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Linear MIM-Width of Trees

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Linear MIM-Width of Trees cs.DS · 2019-07-09 · unverdicted · none · ref 10

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