Author： Dessmark Anders Jansson Jesper Lingas Andrzej Lundell Eva-Marta
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.48, Iss.3, 2007-07, pp. : 233-248
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. :
The Maximum Utilization Subtree Problem
By George J.W.
Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. :
Polynomial-Time Decomposition Algorithms for Support Vector Machines
By Hush D.
Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. :