Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

CPM
2007
Springer

favoriteEmaildiscussreport

74views Combinatorics» more CPM 2007»

Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

14 years 5 months ago

Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

Download www.csd.uwo.ca

Sylvain Guillemot, Vincent Berry

Real-time Traffic

CPM 2007 |

claim paper

Related Content

» Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

» Minimizing Movement FixedParameter Tractability

» Colored Hypergraph Isomorphism is Fixed Parameter Tractable

» Perfect Path Phylogeny Haplotyping with Missing Data Is FixedParameter Tractable

» Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees A Matter of Mutati...

» FixedParameter Algorithms for Kemeny Scores

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	CPM
Authors	Sylvain Guillemot, Vincent Berry

Comments (0)