Heuristics for the Maximum Outerplanar Subgraph Problem

Author： Poranen Timo  

Publisher： Springer Publishing Company

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.11, Iss.1, 2005-01, pp. : 59-88

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

Abstract

Related content

Frequent subgraph mining in outerplanar graphs

By Horváth Tamás  

Data Mining and Knowledge Discovery, Vol. 21, Iss. 3, 2010-11 ,pp. : 472-508

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

An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

By Macambira E.M.  

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 175-190

Springer Publishing Company

Access to resources Recommend Favorite

Maximum Series-Parallel Subgraph

By Călinescu Gruia   Fernandes Cristina   Kaul Hemanshu   Zelikovsky Alexander  

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 137-157

Springer Publishing Company

Access to resources Recommend Favorite

Effective feature construction by maximum common subgraph sampling

By Schietgat Leander   Costa Fabrizio   Ramon Jan   Raedt Luc  

Machine Learning, Vol. 83, Iss. 2, 2011-05 ,pp. : 137-161

Springer Publishing Company

Access to resources Recommend Favorite