Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs
Year of publication: |
1984
|
---|---|
Authors: | Derigs, Ulrich ; Goecke, O. ; Schrader, Rainer |
Publisher: |
Bonn : Inst., Univ. |
Subject: | Matching | Graphentheorie | Graph theory |
Extent: | 8 S graph. Darst |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. - Vol. 84,332 |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Surplus efficiency of ex ante investments in matching markets with nontransferabilities
Gall, Thomas, (2014)
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
The complexity of computing the random priority allocation matrix
Saban, Daniela, (2015)
- More ...
-
Monge sequences and a simple assignment algorithm
Derigs, Ulrich, (1984)
-
Some greedy ideas for the cardinality matching problem
Derigs, Ulrich, (1982)
-
Bachem, Achim, (1994)
- More ...