Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:45, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties |
scientific article |
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
