Author： Andreev A.E. Clementi A. Crescenzi P. Dahlhaus E. De Agostino S. Rolim J.D.P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 261-282
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
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. :
Access to resources
Recommend
Maximum Series-Parallel Subgraph
By Călinescu Gruia Fernandes Cristina Kaul Hemanshu Zelikovsky Alexander
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Heuristics for the Maximum Outerplanar Subgraph Problem
By Poranen Timo
Journal of Heuristics, Vol. 11, Iss. 1, 2005-01 ,pp. :
Constructing the highest degree subgraph for dense graphs is in NCAS
By Andreev A.E. Clementi A.E.F. Rolim J.D.P.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :