Back to Results
First PageMeta Content
NP-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.in
Add to Reading List

Document Date: 2014-08-01 08:33:48

Open Document

File Size: 107,16 KB

Share Result on Facebook

Company

Vertex / G. / /

/

Facility

Neeldhara Misra1 Indian Institute of Science / /

IndustryTerm

faster algorithms / search tree / designed search tree / improved fixed-parameter algorithms / /

Organization

Indian Institute of Science / Bangalore / /

Position

wb / /

Technology

5 An Improved Branching Algorithm / improved FPT algorithm / branching algorithm / FPT algorithms / improved fixed-parameter algorithms / /

SocialTag