2079 search results - page 120 / 416 » Universality of random graphs |
154
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
137
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
151
Voted
PDP
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
168
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
138
Voted
DCC
2007
IEEE
16 years 4 months ago
2007
IEEE
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...