Author： Kashem M.A. Zhou X. Nishizeki T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.240, Iss.2, 2000-06, pp. : 407-427
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. :
Access to resources
Recommend
Maximum packing for k-connected partial k-trees in polynomial time
By Dessmark A. Lingas A. Proskurowski A.
Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. :
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
By Kratsch Stefan Neumann Frank
Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. :
Algorithms for optimal dyadic decision trees
By Hush Don
Machine Learning, Vol. 80, Iss. 1, 2010-07 ,pp. :