5606 search results - page 153 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
PROPERTYTESTING
2010
15 years 1 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
125
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
125
click to vote
PR
2007
15 years 2 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
128
Voted
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
124
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...