Sciweavers

    1998 search results - page 11 / 400
    » Complexity of the Cover Polynomial
    Sort
    View
    DAM
    1999
    119views more  DAM 1999»
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    13 years 9 months ago
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    Download  www.dcs.gla.ac.uk
    The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
    David Manlove
    claim paper
    Read More »
    BNCOD
    2004
    75views Database» more  BNCOD 2004»
    Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity
    13 years 11 months ago
    Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity
    Download  www.furche.net
    Dan Olteanu, Tim Furche, François Bry
    claim paper
    Read More »
    FOCM
    2007
    76views more  FOCM 2007»
    The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
    13 years 9 months ago
    The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
    Download  math-www.uni-paderborn.de
    Peter Bürgisser, Martin Lotz
    claim paper
    Read More »
    PODC
    2009
    ACM
    232views Distributed and Parallel Com...» more  PODC 2009»
    Distributed and parallel algorithms for weighted vertex cover and other covering problems
    14 years 10 months ago
    Distributed and parallel algorithms for weighted vertex cover and other covering problems
    Download  www.cs.ucr.edu
    The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
    Christos Koufogiannakis, Neal E. Young
    claim paper
    Read More »
    SPAA
    2010
    ACM
    282views Distributed And Parallel Com...» more  SPAA 2010»
    Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
    14 years 2 months ago
    Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
    Download  www.cs.helsinki.fi
    We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
    Matti Åstrand, Jukka Suomela
    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.