#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2005

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Prasad Chebolu, Alan M. Frieze, Páll Melsted
- ICALP
- 2008

We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.

- Prasad Chebolu, Alan M. Frieze
- SIAM J. Discrete Math.
- 2008

An n-lift of a digraph K, is a digraph with vertex set V (K)× [n] and for each directed edge (i, j) ∈ E(K) there is a perfect matching between fibers {i} × [n] and {j} × [n], with edges directed from fiber i to fiber j. If these matchings are chosen independently and uniformly at random then we say that we have a random n-lift. We show that if h is… (More)

- Prasad Chebolu, Mary Cryan, Russell Martin
- J. Discrete Algorithms
- 2012

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized series-parallel graph. Note that the class of generalized seriesparallel graphs includes all outerplanar graphs. We can… (More)

- Prasad Chebolu, Páll Melsted
- SODA
- 2008

In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al. [7], and the PageRank-based selection model, proposed by Pandurangan et al. [18]. It has been observed that search engines influence the growth of the Web. The PageRank-based… (More)

- Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
- Theor. Comput. Sci.
- 2010

We investigate the complexity of approximately counting stable matchings in the k-attribute model, where the preference lists are determined by dot products of “preference vectors” with “attribute vectors”, or by Euclidean distances between “preference points“ and “attribute points”. Irving and Leather [16] proved that counting the number of stable… (More)

- Prasad Chebolu, Mary Cryan, Russell Martin
- ArXiv
- 2013

In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be ♯P complete for general graphs (Brightwell and Winkler, 2005 [4]). To date, no polynomial-time algorithm for counting Euler tours of any class of graphs is known… (More)

- Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
- J. Comput. Syst. Sci.
- 2012

We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preference vectors” with “attribute vectors” and (ii) the k-Euclidean model, in which the preference lists are determined by the closeness of the “positions” of the… (More)

- Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin
- APPROX-RANDOM
- 2009

We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the Vickrey cost of a minimum spanning tree (MST) in a complete graph with random edge weights; and the Vickrey cost of a perfect matching in a complete bipartite graph with random edge… (More)

An n-lift of a graph K, is a graph with vertex set V (K)× [n] and for each edge (i, j) ∈ E(K) there is a perfect matching between {i} × [n] and {j} × [n]. If these matchings are chosen independently and uniformly at random then we say that we have a random n-lift. We show that there are constants h1, h2 such that if h ≥ h1 then a random n-lift of the… (More)

- ‹
- 1
- ›