On the maximum uniquely restricted matching for bipartite graphs (Q2840733)
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 maximum uniquely restricted matching for bipartite graphs |
scientific article; zbMATH DE number 6190267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum uniquely restricted matching for bipartite graphs |
scientific article; zbMATH DE number 6190267 |
Statements
23 July 2013
0 references
graph theory
0 references
approximation algorithms
0 references
matchings
0 references
uniquely restricted matchings
0 references
On the maximum uniquely restricted matching for bipartite graphs (English)
0 references
0.9304915070533752
0 references
0.8583807349205017
0 references
0.8557451367378235
0 references
0.8532510995864868
0 references
0.8517681360244751
0 references
