1594 search results - page 261 / 319 » An Algorithm to Compute Collusion Paths |
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
109
click to vote
IPL
2002
15 years 2 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
156
click to vote
DAM
1999
15 years 2 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
151
click to vote
SEKE
2010
Springer
15 years 1 months ago
2010
Springer
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
138
click to vote
CC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...