1986 search results - page 20 / 398 » Path Separability of Graphs |
176
Voted
CGF
2010
15 years 6 months ago
2010
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
156
Voted
APCHI
2004
IEEE
15 years 10 months ago
2004
IEEE
We investigated the use of a new haptic device called the DigiHaptic in a 3D steering task. Unlike other devices intended to interact in 3D with one end-effector, the DigiHaptic ha...
166
Voted
MICS
2008
15 years 6 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
208
Voted
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...