49 search results - page 5 / 10 » New Sparseness Results on Graph Spanners |
122
click to vote
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper investigates minimizing mutual interferences in wireless ad hoc networks by means of topology control. Prior work defines interference as a relationship between link...
PVLDB
2008
14 years 9 months ago
2008
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
106
click to vote
SLS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...