Author: Yu C.-W. Chen G.-H. Ma T.-H.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 85-98
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Heuristics for the Maximum Outerplanar Subgraph Problem
By Poranen Timo
Journal of Heuristics, Vol. 11, Iss. 1, 2005-01 ,pp. :
By Butz Martin Goldberg David Lanzi Pier Sastry Kumara
Genetic Programming and Evolvable Machines, Vol. 8, Iss. 1, 2007-03 ,pp. :