Sciweavers

    721 search results - page 2 / 145
    » Almost universal graphs
    Sort
    View
    ENDM
    2007
    73views more  ENDM 2007»
    Two New Classes of Hamiltonian Graphs: (Extended Abstract)
    14 years 9 months ago
    Two New Classes of Hamiltonian Graphs: (Extended Abstract)
    Download  www.ams.sunysb.edu
    d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
    Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
    claim paper
    Read More »
    STOC
    2000
    ACM
    112views Algorithms» more  STOC 2000»
    A random graph model for massive graphs
    15 years 1 months ago
    A random graph model for massive graphs
    Download  www.math.sc.edu
    We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
    William Aiello, Fan R. K. Chung, Linyuan Lu
    claim paper
    Read More »
    WDAG
    2005
    Springer
    157views Algorithms» more  WDAG 2005»
    (Almost) All Objects Are Universal in Message Passing Systems
    15 years 3 months ago
    (Almost) All Objects Are Universal in Message Passing Systems
    Download  www.liafa.jussieu.fr
    d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
    Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
    claim paper
    Read More »
    ENTCS
    2007
    159views more  ENTCS 2007»
    Almost Every Domain is Universal
    14 years 9 months ago
    Almost Every Domain is Universal
    Download  www.labri.fr
    We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
    Manfred Droste, Dietrich Kuske
    claim paper
    Read More »
    88
    Voted
    SIAMCOMP
    2011
    193views Software Engineering» more  SIAMCOMP 2011»
    A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
    14 years 4 months ago
    A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
    Download  www.cs.tau.ac.il
    Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
    Avraham Ben-Aroya, Amnon Ta-Shma
    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-2025, USA.