Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
WG
1999
Springer
12 years 10 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...
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
12 years 11 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
books