"The Complexity of Finding Paths in Graphs with Bounded Independence Number."

Arfst Nickelsen, Till Tantau (2005)

> Home

Details and statistics

DOI: 10.1137/S0097539704441642

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/NickelsenT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/NickelsenT05
Arfst Nickelsen, Till Tantau:
The Complexity of Finding Paths in Graphs with Bounded Independence Number. SIAM J. Comput. 34(5): 1176-1195 (2005)

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.