Author： Buchsbaum A.L. Giancarlo R. Westbrook J.R.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 707-718
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
Finding houses and holes in graphs
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Access to resources
Recommend
Finding hidden independent sets in interval graphs
By Biedl T. Brejova B. Demaine E.D. Hamel A.M. Lopez-Ortiz A. Vinar T.V.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs
By Krawczyk A.
Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. :
On the complexity of finding common approximate substrings
By Evans P.A. Smith A.D. Wareham H.T.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :