1493 search results - page 206 / 299 » Local resilience of graphs |
GECCO
2006
Springer
13 years 12 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
JAIR
2006
13 years 8 months ago
2006
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
ICALP
2001
Springer
14 years 20 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...