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].
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
A new edge-based μ-representation distinguishes distinct binary semidirected orchard phylogenetic networks and yields a polynomial-time computable distance via reconstruction.
Protective behavior driven by disease information can either suppress or prolong mosquito-borne epidemics and may generate recurrent damped waves, with the net effect depending on transmission parameters and host composition.
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].
-
A $\mu$-distance for semidirected orchard phylogenetic networks
A new edge-based μ-representation distinguishes distinct binary semidirected orchard phylogenetic networks and yields a polynomial-time computable distance via reconstruction.
-
A model for mosquito-borne epidemic outbreaks with information-dependent protective behaviour
Protective behavior driven by disease information can either suppress or prolong mosquito-borne epidemics and may generate recurrent damped waves, with the net effect depending on transmission parameters and host composition.