On some hard and some tractable cases of the maximum acyclic matching problem
Year of publication: |
2019
|
---|---|
Authors: | Fürst, Maximilian ; Rautenbach, Dieter |
Published in: |
Annals of operations research ; volume 279, numbers 1/2 (August 2019). - New York, NY, USA : Springer. - 2019, p. 291-300
|
Subject: | Matching | Induced matching | Uniquely restricted matching | Acyclic matching | Suchtheorie | Search theory |
-
Firm dynamics and assortative matching
Crane, Leland D., (2014)
-
Wapler, Rüdiger, (2018)
-
The heterogeneous impact of referrals on labor market outcomes
Lester, Benjamin, (2021)
- More ...
-
Algorithmic and structural aspects of the P 3-Radon number
Dourado, Mitre C., (2013)
-
Algorithmic and structural aspects of the P3-Radon number
Dourado, Mitre C., (2013)
-
A class of problems for which cyclic relaxation converges linearly
Rautenbach, Dieter, (2008)
- More ...