A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0015438
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

Optimal Bichromatic Plane Spanning Trees for Special Point Sets

English

An Optimal Algorithm for Computing All Subtree Repeats in Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1992English

A Randomized Algorithm for Comparing Sets of Phylogenetic Trees

2007English

The Rectilinear Steiner Ratio

ORiON
2005English

Steiner Minimal Trees on Sets of Four Points

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1987English

A Depth-First Search Algorithm for Computing Pseudo-Closed Sets

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

FSA: A Fast Stepwise Addition Algorithm for Constructing Phylogenetic Trees

International Journal of Bioscience, Biochemistry and Bioinformatics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy