1101 search results - page 113 / 221 » An Algorithm for the Graph Crossing Number Problem |
135
click to vote
ASPDAC
2010
ACM
15 years 3 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
169
Voted
WADS
1993
Springer
15 years 9 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
130
click to vote
TCS
2008
15 years 4 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
125
click to vote
COCOON
2010
Springer
15 years 9 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
125
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...