Browse by Subject: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY (B.6-7, F.1.3)

• (Top Level)
• Theory of Computation
• ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY (B.6-7, F.1.3) (1)
• General
• Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3) (2)
• Numerical Algorithms and Problems (G.1, G.4, I.1)
• Tradeoffs between Complexity Measures (F.1.3)

Chen, Duhong, Eulenstein, Oliver, Fernandez-Baca, David and Sanderson, Michael (2001) Supertrees by Flipping. Technical Report, Department of Computerscience, Iowa State University.