Name
Abstract | ||
|---|---|---|
We describe a flow model that generalizes ordinary network flows the same way as stable matchings generalize the bipartite
matching problem. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages
to stable flows. Our main tool is a straightforward reduction of the stable flow problem to stable allocations.
|
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-16926-7_7 | Algorithms |
Keywords | Field | DocType |
flow model,stable marriage,stable marriages,ordinary network,stable flow,stable allocation,bipartite matching problem,stable allocations,network flows.,main tool,stable matchings,lattice structure,stable flow problem,bipartite matching,network flow,stable matching | Stable roommates problem,Flow network,Discrete mathematics,Combinatorics,Stable marriage problem,Bipartite graph,Flow (psychology),Data flow model,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 1 | 1999-4893 |
ISBN | Citations | PageRank |
3-642-16925-2 | 10 | 0.71 |
References | Authors | |
6 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamás Fleiner | 1 | 241 | 27.45 |