"Parallel Algorithms for Maximum Matching in Complements of Interval Graphs ..."

Marilyn G. Andrews et al. (2000)

> Home

Details and statistics

DOI: 10.1007/S004539910013

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AndrewsACL00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AndrewsACL00
Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica 26(2): 263-289 (2000)

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.