Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
From MaRDI portal
Publication:1802347
DOI10.1016/0196-8858(92)90017-QzbMATH Open0773.05047OpenAlexW2085363210MaRDI QIDQ1802347FDOQ1802347
Péter L. Erdős, László A. Székely
Publication date: 18 October 1993
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(92)90017-q
Recommendations
Cites Work
- Matching theory
- The Steiner problem in phylogeny is NP-complete
- The Complexity of Multiterminal Cuts
- On the multiway cut polyhedron
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
- On the Distribution of Lengths of Evolutionary Trees
- Distributions on bicoloured binary trees arising from the principle of parsimony
Cited In (10)
- A parsimony-based metric for phylogenetic trees
- Minimum multiway cuts in trees
- On weighted multiway cuts in trees
- Evolutionary model for the Steiner tree problem with flow-dependent weights
- An evolutionary approach for finding optimal trees in undirected networks
- Exact algorithms for a discrete metric labeling problem
- Exact algorithms for a discrete metric labeling problem
- Five surprising properties of parsimoniously colored trees
- Algorithmic aspects of homophyly of networks
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
This page was built for publication: Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802347)
