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].
In: Kalyanasundaram S, Maheshwari A (eds) Algorithms and Discrete Applied Mathematics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
citing papers explorer
-
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].
-
Global Least Common Ancestor (LCA) Networks
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.