Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
Undergraduate Texts in Mathematics, Springer, New York, DOI 10.1007/978-1-4757-1645-0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.