Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities (Q2865867)
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: Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities |
scientific article; zbMATH DE number 6237546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities |
scientific article; zbMATH DE number 6237546 |
Statements
11 December 2013
0 references
large graphs
0 references
vertex cover
0 references
mean analysis of algorithms
0 references
Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities (English)
0 references
0.8390510082244873
0 references
0.8015029430389404
0 references
0.7918396592140198
0 references
0.7904388308525085
0 references
