206 search results - page 1 / 42 » Three Hoppy path problems and ternary paths |
DAM
2008
13 years 4 months ago
2008
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
ORL
2007
13 years 4 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
MICRO
2006
IEEE
13 years 10 months ago
2006
IEEE
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...