Author： Gupta A. Nishimura N.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.164, Iss.1, 1996-09, pp. : 287-298
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
Algorithms for generalized vertex-rankings of partial k-trees
By Kashem M.A. Zhou X. Nishizeki T.
Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,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. :
On the complexity of the k-chain subgraph cover problem
By Yu C.-W. Chen G.-H. Ma T.-H.
Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. :
Solving subgraph isomorphism problems with constraint programming
Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. :