On complexity of special maximum matchings constructing (Q952636)
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 5365241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of special maximum matchings constructing |
scientific article; zbMATH DE number 5365241 |
Statements
On complexity of special maximum matchings constructing (English)
0 references
12 November 2008
0 references
maximum matching
0 references
bipartite graph
0 references
\(NP\)-completeness
0 references
0 references
0 references
0.8533594012260437
0 references
0.8493147492408752
0 references
0.8396737575531006
0 references
0.8382086157798767
0 references
