1493 search results - page 13 / 299 » Local resilience of graphs |
97
Voted
NN
2006
Springer
15 years 12 days ago
2006
Springer
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
102
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
145
Voted
COMBINATORICA
2011
14 years 8 days ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
102
Voted
SIROCCO
2008
15 years 1 months ago
2008
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...