"On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs."

Sancrey Rodrigues Alves et al. (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-319-48749-6_31

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/AlvesDFKSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/AlvesDFKSS16
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza:
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437

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.