Sciweavers

1447 search results - page 91 / 290
» Graphs and Path Equilibria
Sort
View
INFOCOM
2006
IEEE
15 years 10 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
ICDCS
2010
IEEE
15 years 8 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ALT
2007
Springer
16 years 1 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
STACS
2004
Springer
15 years 9 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
ADHOCNOW
2005
Springer
15 years 9 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...