16,273 research outputs found
Graph Sparsification by Edge-Connectivity and Random Spanning Trees
We present new approaches to constructing graph sparsifiers --- weighted
subgraphs for which every cut has the same value as the original graph, up to a
factor of . Our first approach independently samples each
edge with probability inversely proportional to the edge-connectivity
between and . The fact that this approach produces a sparsifier resolves
a question posed by Bencz\'ur and Karger (2002). Concurrent work of Hariharan
and Panigrahi also resolves this question. Our second approach constructs a
sparsifier by forming the union of several uniformly random spanning trees.
Both of our approaches produce sparsifiers with
edges. Our proofs are based on extensions of Karger's contraction algorithm,
which may be of independent interest
The clinical trial of FK 506 as primary and rescue immunosuppression in adult cardiac transplantation
Three dimensional global modeling of atmospheric CO2
A model was developed to study the prospects of extracting information on carbon dioxide sources and sinks from observed CO2 variations. The approach uses a three dimensional global transport model, based on winds from a 3-D general circulation model (GCM), to advect CO2 noninteractively, i.e., as a tracer, with specified sources and sinks of CO2 at the surface. The 3-D model employed is identified and biosphere, ocean and fossil fuel sources and sinks are discussed. Some preliminary model results are presented
- …