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

Arfst Nickelsen Till Tantau

Published in: SIAM J. Comput. (2005)

Keyphrases

computational complexity
real time
memory requirements
maximum number
polynomial time complexity
databases
search engine
pairwise
mobile robot
space complexity
network size