Sciweavers

    260 search results - page 3 / 52
    » Resolution Complexity of Independent Sets in Random Graphs
    Sort
    View
    94
    Voted
    RSA
    2002
    66views more  RSA 2002»
    Minimum independent dominating sets of random cubic graphs
    15 years 24 days ago
    Minimum independent dominating sets of random cubic graphs
    Download  www.math.uwaterloo.ca
    William Duckworth, Nicholas C. Wormald
    claim paper
    Read More »
    CORR
    2008
    Springer
    107views Education» more  CORR 2008»
    Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections
    14 years 11 months ago
    Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections
    Download  mit.edu
    David Gamarnik, David A. Goldberg
    claim paper
    Read More »
    109
    Voted
    PODC
    2005
    ACM
    98views Distributed And Parallel Com...» more  PODC 2005»
    Maximal independent sets in radio networks
    15 years 6 months ago
    Maximal independent sets in radio networks
    Download  research.microsoft.com
    We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
    Thomas Moscibroda, Roger Wattenhofer
    claim paper
    Read More »
    93
    Voted
    STOC
    2002
    ACM
    149views Algorithms» more  STOC 2002»
    The complexity of choosing an H-colouring (nearly) uniformly at random
    16 years 1 months ago
    The complexity of choosing an H-colouring (nearly) uniformly at random
    Download  www.csc.liv.ac.uk
    Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
    Leslie Ann Goldberg, Steven Kelk, Mike Paterson
    claim paper
    Read More »
    92
    Voted
    CC
    2000
    Springer
    90views System Software» more  CC 2000»
    The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
    15 years 29 days ago
    The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
    Download  web.maths.unsw.edu.au
    Catherine S. Greenhill
    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-2026, USA.