Sciweavers

    GD
    2004
    Springer
    127views Computer Graphics» more  GD 2004»
    Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
    13 years 10 months ago
    Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
    Download  erikdemaine.org
    Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
    Erik D. Demaine, Mohammad Taghi Hajiaghayi
    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.