Author： Hoang C.T. Sritharan R.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 233-244
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
Detecting Holes and Antiholes in Graphs
By Nikolopoulos Stavros D. Palios Leonidas
Algorithmica, Vol. 47, Iss. 2, 2007-02 ,pp. :
Access to resources
Recommend
On finding common neighborhoods in massive graphs
By Buchsbaum A.L. Giancarlo R. Westbrook J.R.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
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. :