Adversarial resilience of matchings in bipartite random graphs (Q501985)
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: Adversarial resilience of matchings in bipartite random graphs |
scientific article; zbMATH DE number 6673308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adversarial resilience of matchings in bipartite random graphs |
scientific article; zbMATH DE number 6673308 |
Statements
Adversarial resilience of matchings in bipartite random graphs (English)
0 references
10 January 2017
0 references
resilience
0 references
bipartite graph
0 references
matching
0 references
random graph
0 references
0.8208082914352417
0 references
0.8094902038574219
0 references
0.8001016974449158
0 references
0.7938691973686218
0 references
0.7908791303634644
0 references
