1591 search results - page 95 / 319 » Random lifts of graphs |
180
click to vote
ALGORITHMICA
2008
15 years 6 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...
166
click to vote
SODA
2008
ACM
15 years 7 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...
176
click to vote
PDP
2007
IEEE
16 years 18 days 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...
202
click to vote
SODA
2012
ACM
13 years 8 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...
168
click to vote
DAM
2008
15 years 6 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...