Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Fast Compatibility Testing for Rooted Phylogenetic Trees
We present a new graph-based approach to the following basic problem in phylogenetic tree construction. Let $$\mathcal {P}= \{T_1, \ld...
-
Article
Editorial
-
Article
On the efficiency of maximum-flow algorithms on networks with small integer capacities
The performance of maximum-flow algoirthms that work in phases is studied as a function of the maximum arc capacity,C, of the network and a quantity we call thetotal potential, P, of the network, which is related...