On complexity of special maximum matchings constructing (Q952636)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of special maximum matchings constructing |
scientific article |
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
