"The Parallel Complexity of Approximating the High Degree Subgraph Problem."

Alexander E. Andreev et al. (1998)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(97)00276-4

access: open

type: Journal Article

metadata version: 2023-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/AndreevCCDAR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AndreevCCDAR98
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998)

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.