Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].
citing papers explorer
-
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
-
A Characterization of Level-k Realizability for Clustering Systems
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].