On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (Q1683558)
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: On the complexity of minimum cardinality maximal uniquely restricted matching in graphs |
scientific article; zbMATH DE number 6814592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum cardinality maximal uniquely restricted matching in graphs |
scientific article; zbMATH DE number 6814592 |
Statements
On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (English)
0 references
1 December 2017
0 references
matching
0 references
uniquely restricted matching
0 references
bipartite graphs
0 references
graph algorithm
0 references
NP-completeness
0 references
