Sciweavers

    27 search results - page 2 / 6
    » An Expansion Tester for Bounded Degree Graphs
    Sort
    View
    ECCC
    2007
    91views more  ECCC 2007»
    Testing Expansion in Bounded Degree Graphs
    13 years 5 months ago
    Testing Expansion in Bounded Degree Graphs
    Download  www.dcs.warwick.ac.uk
    Satyen Kale, C. Seshadhri
    claim paper
    Read More »
    FOCS
    2007
    IEEE
    112views Theoretical Computer Science» more  FOCS 2007»
    Testing Expansion in Bounded-Degree Graphs
    13 years 11 months ago
    Testing Expansion in Bounded-Degree Graphs
    Download  www.dcs.warwick.ac.uk
    Artur Czumaj, Christian Sohler
    claim paper
    Read More »
    ECCC
    2007
    124views more  ECCC 2007»
    Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
    13 years 5 months ago
    Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
    Download  www.dcs.warwick.ac.uk
    We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
    Artur Czumaj, Asaf Shapira, Christian Sohler
    claim paper
    Read More »
    EJC
    2008
    134views Information Technology» more  EJC 2008»
    Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
    13 years 5 months ago
    Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
    Download  iti.mff.cuni.cz
    We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
    Jaroslav Nesetril, Patrice Ossona de Mendez
    claim paper
    Read More »
    COMBINATORICA
    2007
    117views more  COMBINATORICA 2007»
    Embedding nearly-spanning bounded degree trees
    13 years 5 months ago
    Embedding nearly-spanning bounded degree trees
    Download  www.math.tau.ac.il
    We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
    Noga Alon, Michael Krivelevich, Benny Sudakov
    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.