Finding optimal subgraphs by local search

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 265-271

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

Penguin Search Optimisation Algorithm for Finding Optimal Spaced Seeds

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 7, Iss. 2, 2015-04 ,pp. : 85-99

IGI Global_journal

Access to resources Recommend Favorite

Parameterized complexity of finding subgraphs with hereditary properties

By Khot S. Raman V.

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 997-1008

Elsevier

Access to resources Recommend Favorite

Local Search-based Hybrid Algorithms for Finding Golomb Rulers

By Cotta Carlos Dotú Iván Fernández Antonio Hentenryck Pascal

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 263-291

Springer Publishing Company

Access to resources Recommend Favorite

Finding optimal paths in MREP routing

By Fleischer R. Golin M. Lea C.-T. Wong S.

Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. : 57-63

Elsevier

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite