ICALP
1994
Springer
13 years 8 months ago
1994
Springer
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...
COMPGEOM
1994
ACM
13 years 8 months ago
1994
ACM
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...
ISCAS
2003
IEEE
13 years 9 months ago
2003
IEEE
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...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
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...
GD
2004
Springer
13 years 10 months ago
2004
Springer
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...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
— 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...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
—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 ...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
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...