Author: Bouchitte V. Todinca I.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.276, Iss.1, 2002-04, pp. : 17-32
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
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Enumerating all connected maximal common subgraphs in two graphs
By Koch I.
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :
The hierarchical cliques interconnection network
By Campbell S. Kumar M. Olariu S.
Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. :