Sciweavers

632 search results - page 88 / 127
» On Routing in Circulant Graphs
Sort
View
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
14 years 9 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
STACS
2009
Springer
14 years 3 months ago
The Price of Anarchy in Cooperative Network Creation Games
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 8 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
14 years 3 months ago
Information retrieval system for human-robot communication - Asking for directions
— The creation of a robot capable of navigating in unknown urban environments without the use of GPS data or prior map knowledge is envisioned in the Autonomous City Explorer (AC...
Andrea Maria Bauer, Dirk Wollherr, Martin Buss
CIKM
2009
Springer
14 years 3 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...