Algorithms for popular matchings. More...
#include <LEP/mosp/config.h>#include <LEDA/graph.h>#include <LEDA/list.h>#include <LEDA/edge_array.h>#include <LEDA/std/assert.h>#include <LEDA/string.h>#include <LEP/mosp/graphcopy.h>
Include dependency graph for POPULAR.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| mosp | |
| The main package namespace. | |
Functions | |
| bool | mosp::BI_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, leda::list< leda::edge > &L) |
| Compute a popular matching. More... | |
| bool | mosp::BI_APPROX_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, int maxphase, leda::list< leda::edge > &L, int &phase) |
| Compute an approximate popular matching. More... | |
| bool | mosp::BI_APPROX_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, leda::list< leda::edge > &L, int &phase) |
| Compute an approximate popular matching. More... | |
| bool | mosp::BI_UNPOPULARITY_FACTOR (graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const list< edge > &M, int &factor) |
| Compute the unpopularity factor of a matching. More... | |
| bool | mosp::BI_POPULAR_CAPACITATED_MATCHING (const graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const node_array< int > &capacity, list< edge > &L) |
| Compute a popular matching in a capacitated instance. More... | |
| int | mosp::BI_UNPOPULARITY_MARGIN (graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const list< edge > &M) |
| Compute the unpopularity margin of a matching. More... | |
Detailed Description
Algorithms for popular matchings.
