Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The computational complexity of graph contractions II: Two tough ..."

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger (2008)

> Home

Details and statistics

DOI: 10.1002/NET.20249

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/LevinPW08a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/LevinPW08a
Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008)

a service of

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.