3268 search results - page 462 / 654 » The hub number of a graph |
133
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
141
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph s...
180
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
171
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
163
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...