552 search results - page 25 / 111 » Lower bounds for dynamic connectivity |
SIAMCOMP
2002
14 years 9 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
106
click to vote
GEOINFORMATICA
2011
14 years 4 months ago
2011
The research reported in this paper uses wireless sensor networks to provide salient information about spatially distributed dynamic fields, such as regional variations in tempera...
ECCC
2008
14 years 10 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
EOR
2008
14 years 9 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...