"Degree-Constrained Subgraph Problems: Hardness and Approximation Results."

Omid Amini et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-93980-1_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-10-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/waoa/AminiPPSS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/AminiPPSS08
Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42

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.