Sciweavers

2322 search results - page 109 / 465
» On a game in directed graphs
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
16 years 1 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
188
Voted
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
16 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
212
Voted
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
16 years 7 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
169
Voted
COCOON
2003
Springer
16 years 6 days ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
158
Voted
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 11 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann