Results 1  10
of
562
Maintaining a Large Matching and a Small Vertex Cover
"... We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor and han ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor
Dynamic Approximate Vertex Cover and Maximum Matching
, 2010
"... We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a seque ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a
The Design and Implementation of a LogStructured File System
 ACM Transactions on Computer Systems
, 1992
"... This paper presents a new technique for disk storage management called a logstructured file system. A logstructured file system writes all modifications to disk sequentially in a loglike structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk; it ..."
Abstract

Cited by 1092 (8 self)
 Add to MetaCart
; it contains indexing information so that files can be read back from the log efficiently. In order to maintain large free areas on disk for fast writing, we divide the log into segments and use a segment cleaner to compress the live information from heavily fragmented segments. We present a series
Parameterized Streaming: Maximal Matching and Vertex Cover
"... As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems ov ..."
Abstract
 Add to MetaCart
bining kernelization techniques with randomized sketch structures, we obtain the first streaming algorithms for the parameterized versions of Maximal Matching and Vertex Cover. We consider various models for a graph stream on n nodes: the insertiononly model where the edges can only be added, and the dynamic model
Packet Classification using Tuple Space Search
 In Proc. of SIGCOMM
, 1999
"... Routers must perform packet classification at high speeds to efficiently implement functions such as rewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet according to the highest priority filter. Existing fil ..."
Abstract

Cited by 195 (7 self)
 Add to MetaCart
Routers must perform packet classification at high speeds to efficiently implement functions such as rewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet according to the highest priority filter. Existing
Vertex Cover in Graphs with Locally Few Colors
, 2011
"... In [14], Erdős et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are graphs with arbitrarily large chromatic number that can be colored so that (i) no vertex neighborhood contains more than ∆ dif ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In [14], Erdős et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are graphs with arbitrarily large chromatic number that can be colored so that (i) no vertex neighborhood contains more than
A classification of natural rivers.
 Catena
, 1994
"... Abstract A classification system for natural rivers is presented in which a morphological arrangement of stream characteristics is organized into relatively homogeneous stream types. This paper describes morphologically similar stream reaches that are divided into 7 major stream type categories tha ..."
Abstract

Cited by 173 (1 self)
 Add to MetaCart
classification interrelationships were derived from 450 rivers throughout the U.S, Canada, and New Zealand. Data used in the development of this classification involved a great diversity of hydrophysiographic/geomorphic provinces from small to large rivers and in catchments from headwater streams
INVITED PAPER Special Section on Invited Papers from New Horizons in Computing Approximated Vertex Cover for Graphs with Perfect Matchings
"... one can achieve an approximation factor of less than two for VCPM, then one can do so for general Vertex Cover as well. (ii) There is an algorithm for VCPM whose approximation factor is given as 1.069 + 0.069d where d is the average degree of the given graph. In this paper we improve (ii). Namely ..."
Abstract
 Add to MetaCart
we give a new VCPM algorithm which greatly outperforms the above one and its approximation factor is roughly 2 − 6.74. Our algorithm d+6.28 also works for graphs with “large ” matchings, although its approximation factor is degenerated. key words: approximation algorithm, vertex cover, perfect
Results 1  10
of
562