The parallel complexity of approximating the high degree subgraph problem

By Andreev A.E.   Clementi A.   Crescenzi P.   Dahlhaus E.   De Agostino S.   Rolim J.D.P.  

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 261-282

Elsevier

Access to resources Recommend Favorite

The complexity of subgraph isomorphism for classes of partial k-trees

By Gupta A.   Nishimura N.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 287-298

Elsevier

Access to resources Recommend Favorite

Heuristics for the Maximum Outerplanar Subgraph Problem

By Poranen Timo  

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

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

Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity

By Butz Martin   Goldberg David   Lanzi Pier   Sastry Kumara  

Genetic Programming and Evolvable Machines, Vol. 8, Iss. 1, 2007-03 ,pp. : 5-37

Springer Publishing Company

Access to resources Recommend Favorite