"A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover ..."

Hong Xu, T. K. Satish Kumar, Sven Koenig (2017)

> Home

Details and statistics

DOI: 10.1609/SOCS.V8I1.18414

access: open

type: Conference or Workshop Paper

metadata version: 2023-12-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/XuKK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/XuKK17
Hong Xu, T. K. Satish Kumar, Sven Koenig:
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. SOCS 2017: 173-174

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.