The Complexity of Finding Paths in Graphs with Bounded...

SIAM Journal on Computing 2005 / 01 Vol. 34; Iss. 5

The Complexity of Finding Paths in Graphs with Bounded Independence Number

Nickelsen, Arfst, Tantau, Till
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
34
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/s0097539704441642
Date:
January, 2005
File:
PDF, 289 KB
english, 2005
Conversion to is in progress
Conversion to is failed