"The Parallel Complexity of Approximation Algorithms for the Maximum ..."

Raymond Greenlaw (1992)

> Home

Details and statistics

DOI: 10.1007/BF01374523

access: closed

type: Journal Article

metadata version: 2020-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Greenlaw92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Greenlaw92
Raymond Greenlaw:
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Math. Syst. Theory 25(3): 161-175 (1992)

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.