Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

First Page		Document Content
Date: 2016-01-03 06:45:52 Mathematics Computational complexity theory Graph theory Analysis of algorithms NP-complete problems Probabilistic complexity theory Combinatorics Randomized algorithm Rejection sampling NP Independent set Poisson distribution		Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 385,04 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document