R. Motwani and M. Sudan. Square is NP-complete. Manuscript, September 1991. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Algorithms for Square Roots of Graphs - Lin, Skiena (1991) (12 citations) (Correct)
....characterization of the squares of graphs involve the concept of clique which is an NP complete problem in general. Furthermore, note that the characterization given by Mukhopadhyay dealing with some n cliques of G which will have exponentially many candidate cliques. Indeed, Motwani and Sudan [20] showed that recognizing the general square graphs is an NP complete problem. Fleischner [8] proved that the square of a biconnected graph is always Hamiltonian. Although the Hamiltonian cycle problem is NP complete for general graphs [10] the biconnectivity of a graph can be tested in linear ....
R. Motwani and M. Sudan. Square is NP-complete. Manuscript, September 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC