Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier France - computational complexity theory - Document - PDFSEARCH.IO

First Page	Meta Content
	Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier France Add to Reading List Document Date: 2006-07-28 09:21:00 Open Document File Size: 541,72 KB Share Result on Facebook Person Sylvain Guillemot / Nicolas Solving / / Technology FPT algorithms / Snp / / SocialTag Computer science Computing Computational complexity theory Parameterized complexity B-tree

Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier FranceAdd to Reading List