"The matching extension problem in general graphs is co-NP-complete."

Jan Hackfeld, Arie M. C. A. Koster (2018)

> Home

Details and statistics

DOI: 10.1007/S10878-017-0226-X

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/HackfeldK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/HackfeldK18
Jan Hackfeld, Arie M. C. A. Koster:
The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35(3): 853-859 (2018)

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.