Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085)
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: Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties |
scientific article; zbMATH DE number 5553592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties |
scientific article; zbMATH DE number 5553592 |
Statements
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (English)
0 references
13 May 2009
0 references
stable matching problem
0 references
stable marriage problem
0 references
interconnection networks
0 references
multi-stage interconnection networks
0 references
stability
0 references
unstability
0 references
path-length
0 references
preference lists
0 references
optimal pairs
0 references
ties
0 references
0.7871201634407043
0 references
0.7702625393867493
0 references
0.769516110420227
0 references
