Author: Zampelli Stéphane
Publisher: Springer Publishing Company
ISSN: 1383-7133
Source: Constraints, Vol.15, Iss.3, 2010-07, pp. : 327-353
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. :