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

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

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

By Berry V.   Peng Z.   Ting H.  

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

Springer Publishing Company

Access to resources Recommend Favorite

New heuristics for the maximum diversity problem

By Silva Geiza   Andrade Marcos   Ochi Luiz   Martins Simone   Plastino Alexandre  

Journal of Heuristics, Vol. 13, Iss. 4, 2007-08 ,pp. : 315-336

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid heuristic for the maximum clique problem

By Singh Alok   Gupta Ashok  

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 5-22

Springer Publishing Company

Access to resources Recommend Favorite