Sciweavers

    IWPEC
    2009
    Springer
    103views Applied Computing» more  IWPEC 2009»
    Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
    14 years 7 months ago
    Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
    Download  faculty.cs.tamu.edu
    We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
    Petr A. Golovach, Dimitrios M. Thilikos
    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.