Sciweavers

4865 search results - page 311 / 973
» The Complexity of Graph Connectivity
Sort
View
NETWORKS
2010
15 years 5 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
16 years 1 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
EUROSYS
2009
ACM
16 years 3 months ago
User interactions in social networks and their implications
Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that l...
Christo Wilson, Bryce Boe, Alessandra Sala, Krishn...
165
Voted
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
16 years 6 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 6 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis