Sciweavers

    1949 search results - page 11 / 390
    » Random graphs on surfaces
    Sort
    View
    WEA
    2005
    Springer
    154views Algorithms» more  WEA 2005»
    Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
    15 years 5 months ago
    Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
    Download  www.cs.rpi.edu
    This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
    Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
    claim paper
    Read More »
    EJC
    2008
    152views Information Technology» more  EJC 2008»
    Expansion properties of a random regular graph after random vertex deletions
    14 years 11 months ago
    Expansion properties of a random regular graph after random vertex deletions
    Download  web.maths.unsw.edu.au
    We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
    Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
    claim paper
    Read More »
    RSA
    2006
    132views more  RSA 2006»
    Almost universal graphs
    14 years 11 months ago
    Almost universal graphs
    Download  www.math.cmu.edu
    We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c
    Alan M. Frieze, Michael Krivelevich
    claim paper
    Read More »
    FOCS
    1995
    IEEE
    101views Theoretical Computer Science» more  FOCS 1995»
    Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
    15 years 3 months ago
    Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
    Download  eprints.iisc.ernet.in
    C. R. Subramanian
    claim paper
    Read More »
    CPC
    2000
    81views more  CPC 2000»
    Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
    14 years 11 months ago
    Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
    Download  www.lsi.upc.edu
    Josep Díaz, Mathew D. Penrose, Jordi Petit,...
    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.