Sciweavers

Share
3 search results - page 1 / 1
» Finding Smallest Supertrees Under Minor Containment
Sort
View
WG
1999
Springer
12 years 9 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine diļ¬€erences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
DAM
2010
112views more  DAM 2010»
12 years 5 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
12 years 6 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
books