Sciweavers

2079 search results - page 5 / 416
» Universality of random graphs
Sort
View
CPC
2002
95views more  CPC 2002»
15 years 1 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
CVPR
2009
IEEE
16 years 4 days ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 years 2 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 5 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
297
Voted

Book
1174views
16 years 11 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel