![NP-complete problems / Vertex cover / Vertex / Graph / Hamiltonian path / Tree / Clique / Neighbourhood / Connectivity / Graph theory / Mathematics / Theoretical computer science NP-complete problems / Vertex cover / Vertex / Graph / Hamiltonian path / Tree / Clique / Neighbourhood / Connectivity / Graph theory / Mathematics / Theoretical computer science](https://www.pdfsearch.io/img/ecba0748b6167c69156388035d5834e8.jpg) Date: 2014-08-01 08:33:48NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science | | Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.inAdd to Reading ListSource URL: drona.csa.iisc.ernet.inDownload Document from Source Website File Size: 107,16 KBShare Document on Facebook
|