Results 1 
6 of
6
A parallel algorithmic version of the local lemma
, 1991
"... The Lovász Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for ..."
Abstract

Cited by 58 (10 self)
 Add to MetaCart
The Lovász Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for converting some of these existence proofs into efficient algorithmic procedures, at the cost of loosing a little in the estimates. His method does not seem to be parallelizable. Here we modify his technique and achieve an algorithmic version that can be parallelized, thus obtaining deterministic NC 1 algorithms for several interesting algorithmic problems.
Graph Treewidth and Geometric Thickness Parameters
 DISCRETE AND COMPUTATIONAL GEOMETRY
, 2005
"... Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness. By restricting the edges to be straight, we obtain the geometric thickness. By additionally restri ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness. By restricting the edges to be straight, we obtain the geometric thickness. By additionally restricting the vertices to be in convex position, we obtain the book thickness. This paper studies the relationship between these parameters and treewidth. Our first main result states that for graphs of treewidth k, the maximum thickness and the maximum geometric thickness both equal ⌈k/2⌉. This says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. Our second main result states that for graphs of treewidth k, the maximum book thickness equals k if k ≤ 2 and equals k + 1 if k ≥ 3. This refutes a conjecture of Ganley and Heath [Discrete Appl. Math. 109(3):215–221, 2001]. Analogous results are proved for outerthickness, arboricity, and stararboricity.
Approximating the spanning star forest problem and its applications to genomic sequence alignment
 In SODA
, 2007
"... Abstract. This paper studies the algorithmic issues of the spanning star forest problem. We prove the following results: (1) There is a polynomialtime approximation scheme for planar graphs; (2) there is a polynomialtime 3approximation algorithm for graphs; (3) it is NPhard to approxi5 mate the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. This paper studies the algorithmic issues of the spanning star forest problem. We prove the following results: (1) There is a polynomialtime approximation scheme for planar graphs; (2) there is a polynomialtime 3approximation algorithm for graphs; (3) it is NPhard to approxi5 mate the problem within ratio 259 + ɛ for graphs; (4) there is a lineartime algorithm to compute the 260 maximum star forest of a weighted tree; (5) there is a polynomialtime 1approximation algorithm 2 for weighted graphs. We also show how to apply this spanning star forest model to aligning multiple genomic sequences over a tandem duplication region. Key words. Dominating set, spanning star forest, approximation algorithm, genomic sequence alignment AMS subject classifications. 68Q17, 68Q25, 68R10, 68W25 1. Introduction. A
Packing paths in digraphs
"... f ~P1g, or f ~P1; ~P2g, the Gpacking problem is NPcomplete. When G = f ~P1g, the Gpacking problem is simply the matching problem. We treat in detail the one remaining case, G = f ~P1; ~P2g. We give in this case a polynomial algorithm for the packing problem. We also give the following positive re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
f ~P1g, or f ~P1; ~P2g, the Gpacking problem is NPcomplete. When G = f ~P1g, the Gpacking problem is simply the matching problem. We treat in detail the one remaining case, G = f ~P1; ~P2g. We give in this case a polynomial algorithm for the packing problem. We also give the following positive results: a Berge type augmenting configuration theorem, a minmax characterization, and a reduction to bipartite matching. These results apply also to packings by the family G consisting of all directed paths and cycles. We also explore weighted variants of the problem and include a polyhedral analysis.
The Subchromatic Index of Graphs
, 2004
"... In an edge coloring of a graph, each color class forms a subgraph without path of length two (a matching). An edge subcoloring generalizes this concept: Each color class in an edge subcoloring forms a subgraph without path of length three. While every graph with maximum degree at most two is edg ..."
Abstract
 Add to MetaCart
In an edge coloring of a graph, each color class forms a subgraph without path of length two (a matching). An edge subcoloring generalizes this concept: Each color class in an edge subcoloring forms a subgraph without path of length three. While every graph with maximum degree at most two is edge 2subcolorable, we point out in this paper that recognizing edge 2subcolorable graphs with maximum degree three is NPcomplete, even when restricted to trianglefree graphs. As byproducts, we obtain NPcompleteness results for the star index and the subchromatic number for several classes of graphs. It is also proved that recognizing edge 3subcolorable graphs is NPcomplete.
Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment
"... This paper studies the algorithmic issues of the spanning star forest problem. We prove the following results: (1) there is a polynomialtime approximation scheme for planar unweighted graphs; (2) there is a polynomialtime algorithm with approximation ratio 3 5 for unweighted graphs; (3) it is NPh ..."
Abstract
 Add to MetaCart
This paper studies the algorithmic issues of the spanning star forest problem. We prove the following results: (1) there is a polynomialtime approximation scheme for planar unweighted graphs; (2) there is a polynomialtime algorithm with approximation ratio 3 5 for unweighted graphs; (3) it is NPhard to approximate the problem within ratio 545 546 + ɛ for unweighted graphs; (4) there is a lineartime algorithm to compute the maximum star forest of a weighted tree; (5) there is a polynomialtime algorithm with approximation ratio 1 2 for weighted graphs. We also show how to apply this spanning star forest model to aligning multiple genomic sequences over a tandem duplication region. 1