94 search results - page 12 / 19 » Packing d-degenerate graphs |
111
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
112
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
107
Voted
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
113
click to vote
ISPD
1999
ACM
15 years 6 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
125
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...