From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

ISSN： 0178-4617

Source： Algorithmica, Vol.50, Iss.3, 2008-03, pp. : 369-385

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

By Dessmark Anders Jansson Jesper Lingas Andrzej Lundell Eva-Marta

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 233-248

Springer Publishing Company

Access to resources Recommend Favorite

The weight-constrained maximum-density subtree problem and related problems in trees

By Hsieh Sun-Yuan Chou Ting-Yu

The Journal of Supercomputing, Vol. 54, Iss. 3, 2010-12 ,pp. : 366-380

Springer Publishing Company

Access to resources Recommend Favorite

The Maximum Utilization Subtree Problem

By George J.W.

Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. : 133-151

Springer Publishing Company

Access to resources Recommend Favorite

Just in Time Control of Constrained (max,+)-Linear Systems

By Houssin Laurent Lahaye Sébastien Boimond Jean-Louis

Discrete Event Dynamic Systems, Vol. 17, Iss. 2, 2007-06 ,pp. : 159-178

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons

By Qian Jianbo Wang Cao An

Algorithmica, Vol. 40, Iss. 3, 2004-08 ,pp. : 161-172

Springer Publishing Company

Access to resources Recommend Favorite