Results 1  10
of
431,771
Aerosols, climate and the hydrological cycle
 Science
, 2001
"... Human activities are releasing tiny particles (aerosols) into the atmosphere. These humanmade aerosols enhance scattering and absorption of solar radiation. They also produce brighter clouds that are less efÞcient at releasing precipitation. These in turn lead to large reductions in the amount of s ..."
Abstract

Cited by 200 (6 self)
 Add to MetaCart
Human activities are releasing tiny particles (aerosols) into the atmosphere. These humanmade aerosols enhance scattering and absorption of solar radiation. They also produce brighter clouds that are less efÞcient at releasing precipitation. These in turn lead to large reductions in the amount
Global and regional climate changes due to black carbon,
 Nat. Geosci.,
, 2008
"... Figure 1: Global distribution of BC sources and radiative forcing. a, BC emission strength in tons per year from a study by Bond et al. Full size image (42 KB) Review Nature Geoscience 1, 221 227 (2008 Black carbon in soot is the dominant absorber of visible solar radiation in the atmosphere. Ant ..."
Abstract

Cited by 227 (5 self)
 Add to MetaCart
to dimming at the Earth's surface with important implications for the hydrological cycle, and the deposition of black carbon darkens snow and ice surfaces, which can contribute to melting, in particular of Arctic sea ice. Black carbon (BC) is an important part of the combustion product commonly referred
Packs
"... This report was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, c ..."
Abstract
 Add to MetaCart
This report was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States government or any agency thereof. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States government or any agency thereof.
Cycle packing
"... In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be partitioned into O(n) cycles and edges. They observed that one can easily get an O(n log n) upper bound by repeatedly removing the edges of the longest cycle. We make the first progress on this problem, ..."
Abstract
 Add to MetaCart
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be partitioned into O(n) cycles and edges. They observed that one can easily get an O(n log n) upper bound by repeatedly removing the edges of the longest cycle. We make the first progress on this problem
Abyssal recipes
 DeepSea Res
, 1966
"... AbstractVertical distributions in the interior Pacific (excluding tbe top and bottom kilometer) are not inzonsistent with a simple model involving aconstant upward vertical velozity w ~ 12 cm clu yt and eddy diffusivity, ¢ ~ 1.3 cm ~ sec1. Thus temperature and salinity can be fitted by expone ..."
Abstract

Cited by 173 (0 self)
 Add to MetaCart
the inferred rates of upwelling and diffusion? The annual freezing of 2.1 x 10 to g of Antarctic pack ice is associated with bottom water formation in the ratio 43: 1, yielding an estimated 4 × 10:0 g yeart of Pacific bottom water; the value w = 1"2 cm dayt implies 6 x 10 ~0 g yearL I have attempted
Packing Cycles in Undirected Graphs
"... Given an undirected graph G with n nodes and m edges, we address the problem of finding a largest collection of edgedisjoint cycles in G. The problem, dubbed Cycle Packing, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study the complex ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Given an undirected graph G with n nodes and m edges, we address the problem of finding a largest collection of edgedisjoint cycles in G. The problem, dubbed Cycle Packing, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study
Packing directed cycles efficiently
 In Proc. ISAP'01
, 2004
"... Let G be a simple digraph. The dicycle packing number of G, denoted νc(G), is the maximum size of a set of arcdisjoint directed cycles in G. Let G be a digraph with a nonnegative arcweight function w. A function ψ from the set C of directed cycles in G to R+ is a fractional dicycle packing of G if ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Let G be a simple digraph. The dicycle packing number of G, denoted νc(G), is the maximum size of a set of arcdisjoint directed cycles in G. Let G be a digraph with a nonnegative arcweight function w. A function ψ from the set C of directed cycles in G to R+ is a fractional dicycle packing of G
Approximability of packing disjoint cycles
 IN: PROCEEDINGS OF 18TH INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION
, 2007
"... Given a graph G, the edgedisjoint cycle packing problem is to nd the largest set of cycles of which no two share an edge. For undirected graphs, the best known approximation algorithm has ratio O( p log n) where n = jV (G)j and is due to Krivelevich et al [14, 15]. In fact, they proved the same upp ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Given a graph G, the edgedisjoint cycle packing problem is to nd the largest set of cycles of which no two share an edge. For undirected graphs, the best known approximation algorithm has ratio O( p log n) where n = jV (G)j and is due to Krivelevich et al [14, 15]. In fact, they proved the same
Finding Odd Cycle Transversals
, 2003
"... We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle cover of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k. ..."
Abstract

Cited by 96 (2 self)
 Add to MetaCart
We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle cover of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k.
Results 1  10
of
431,771