An efficient distributed algorithm for maximum matching in general graphs (Q911306)
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: An efficient distributed algorithm for maximum matching in general graphs |
scientific article; zbMATH DE number 4141520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient distributed algorithm for maximum matching in general graphs |
scientific article; zbMATH DE number 4141520 |
Statements
An efficient distributed algorithm for maximum matching in general graphs (English)
0 references
1990
0 references
distributed algorithm
0 references
matching
0 references
graph algorithms
0 references
combinatorial optimization
0 references
0.8748679757118225
0 references
0.854217529296875
0 references
0.8497801423072815
0 references
0.8418692350387573
0 references
