Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the complexity of the identifiable subgraph problem, revisited."

Stefan Kratsch, Martin Milanic (2017)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2017.04.028

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/KratschM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KratschM17
Stefan Kratsch, Martin Milanic:
On the complexity of the identifiable subgraph problem, revisited. Discret. Appl. Math. 226: 78-86 (2017)

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.