"On the computational complexity of the bipartizing matching problem."

Carlos V. G. C. Lima et al. (2022)

> Home

Details and statistics

DOI: 10.1007/S10479-021-03966-9

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/LimaRSS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/LimaRSS22
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 316(2): 1235-1256 (2022)

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.