Sciweavers

ICALP
1994
Springer
14 years 4 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick
COMPGEOM
1994
ACM
14 years 4 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 5 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
14 years 5 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
GD
2004
Springer
14 years 5 months ago
Simultaneous Embedding of Planar Graphs with Few Bends
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
Cesim Erten, Stephen G. Kobourov
FOCS
2005
IEEE
14 years 6 months ago
Learning mixtures of product distributions over discrete domains
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
14 years 6 months ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
CISS
2008
IEEE
14 years 7 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker
BIRTHDAY
2009
Springer
14 years 7 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...