Author： Dessmark A. Lingas A. Proskurowski A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.236, Iss.1, 2000-04, pp. : 179-191
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
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. :
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
By Guo Wenzhong Xiong Naixue Vasilakos Athanasios V. Chen Guolong Yu Chaolong
International Journal of Sensor Networks, Vol. 12, Iss. 1, 2012-07 ,pp. :
Maximum tree-packing in time O(n 52 )
By Lingas A.
Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. :