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

Alexander E. Andreev et al. (1995)

> Home

Details and statistics

DOI: 10.1007/BFB0015416

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/AndreevCCDAR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/AndreevCCDAR95
Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141

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.