The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5279456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number |
scientific article; zbMATH DE number 5279456 |
Statements
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (English)
0 references
27 May 2008
0 references
0 references
0 references
0 references
0.946677565574646
0 references
0.915957510471344
0 references
0.851087212562561
0 references
0.8100736737251282
0 references
0.8067620992660522
0 references
