Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess (Q5370992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess |
scientific article; zbMATH DE number 6797179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess |
scientific article; zbMATH DE number 6797179 |
Statements
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess (English)
0 references
24 October 2017
0 references
0.8359326124191284
0 references
0.8344541788101196
0 references
0.8015029430389404
0 references
0.7880645394325256
0 references
