Sciweavers

    RSA
    2008
    125views more  RSA 2008»
    The game chromatic number of random graphs
    13 years 3 months ago
    The game chromatic number of random graphs
    Download  www.math.ucla.edu
    : Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
    Tom Bohman, Alan M. Frieze, Benny Sudakov
    claim paper
    Read More »
    RSA
    2008
    78views more  RSA 2008»
    How many random edges make a dense hypergraph non-2-colorable?
    13 years 3 months ago
    How many random edges make a dense hypergraph non-2-colorable?
    Download  www.math.ucla.edu
    : We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
    Benny Sudakov, Jan Vondrák
    claim paper
    Read More »
    RSA
    2008
    81views more  RSA 2008»
    Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
    13 years 3 months ago
    Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
    Download  christofides.org
    Demetres Christofides, Klas Markström
    claim paper
    Read More »
    RSA
    2008
    89views more  RSA 2008»
    Simple permutations mix even better
    13 years 3 months ago
    Simple permutations mix even better
    Download  people.cs.ubc.ca
    We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
    Alex Brodsky, Shlomo Hoory
    claim paper
    Read More »
    RSA
    2008
    81views more  RSA 2008»
    Analyzing linear mergers
    13 years 3 months ago
    Analyzing linear mergers
    Download  www.wisdom.weizmann.ac.il
    Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
    Zeev Dvir, Ran Raz
    claim paper
    Read More »
    RSA
    2008
    123views more  RSA 2008»
    Generating unlabeled connected cubic planar graphs uniformly at random
    13 years 3 months ago
    Generating unlabeled connected cubic planar graphs uniformly at random
    Download  www2.informatik.hu-berlin.de
    We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
    Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    claim paper
    Read More »
    « first‹ previous123
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.