Sciweavers

    46 search results - page 1 / 10
    » Coloring with no 2-Colored P4's
    Sort
    View
    COMBINATORICS
    2004
    83views more  COMBINATORICS 2004»
    Coloring with no 2-Colored P4's
    13 years 4 months ago
    Coloring with no 2-Colored P4's
    Download  www.combinatorics.org
    Michael O. Albertson, Glenn G. Chappell, Henry A. ...
    claim paper
    Read More »
    DMTCS
    2011
    261views Mathematics» more  DMTCS 2011»
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    12 years 4 months ago
    An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    Download  www.math.uni-hamburg.de
    Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
    Yury Person, Mathias Schacht
    claim paper
    Read More »
    SSS
    2010
    Springer
    158views Control Systems» more  SSS 2010»
    Low Memory Distributed Protocols for 2-Coloring
    13 years 2 months ago
    Low Memory Distributed Protocols for 2-Coloring
    Download  cseweb.ucsd.edu
    In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
    Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
    claim paper
    Read More »
    RSA
    2008
    78views more  RSA 2008»
    How many random edges make a dense hypergraph non-2-colorable?
    13 years 4 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 »
    JGT
    2010
    63views more  JGT 2010»
    Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
    13 years 2 months ago
    Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
    Download  web.cs.wpi.edu
    András Gyárfás, Gábor ...
    claim paper
    Read More »
    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.