Sciweavers

1447 search results - page 165 / 290
» Graphs and Path Equilibria
Sort
View
IPPS
2002
IEEE
15 years 9 months ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
INFOCOM
2009
IEEE
15 years 11 months ago
Noncooperative Load Balancing in the Continuum Limit of a Dense Network
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
Eitan Altman, Ishai Menache, Asuman E. Ozdaglar
MFCS
2005
Springer
15 years 10 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
WG
2004
Springer
15 years 10 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
133
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 9 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...