Sciweavers

296 search results - page 13 / 60
» Group connectivity of certain graphs
Sort
View
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 7 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
INFOCOM
2008
IEEE
14 years 2 months ago
On Maintaining Sensor-Actor Connectivity in Wireless Sensor and Actor Networks
—In wireless sensor and actor networks (WSANs), a group of sensors and actors are connected by a wireless medium to perform distributed sensing and acting tasks. Sensors usually ...
Jie Wu, Shuhui Yang, Mihaela Cardei
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 7 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...