"On some hard and some tractable cases of the maximum acyclic matching problem."

Maximilian Fürst, Dieter Rautenbach (2019)

> Home

Details and statistics

DOI: 10.1007/S10479-019-03311-1

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/FurstR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/FurstR19
Maximilian Fürst, Dieter Rautenbach:
On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 279(1-2): 291-300 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.