"Computing Maximum-Cardinality Matchings in Sparse General Graphs."

John D. Kececioglu, A. Justin Pecqueur (1998)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2021-05-07

- no documents available
- export record
  dblp key:
  - conf/wae/KececiogluP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wae/KececiogluP98
John D. Kececioglu, A. Justin Pecqueur:
Computing Maximum-Cardinality Matchings in Sparse General Graphs. WAE 1998: 121-132

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.