Sciweavers

    IPL
    2008
    107views more  IPL 2008»

    Reachability on prefix-recognizable graphs

    13 years 11 months ago
    Reachability on prefix-recognizable graphs
    Download  www.informatik.uni-bremen.de
    We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachability, Prefix-recognizable graphs, Computational complexity, Alternation
    Stefan Göller
    claim paper
    Added 12 Dec 2010
    Updated 12 Dec 2010
    Type Journal
    Year 2008
    Where IPL
    Authors Stefan Göller
    Comments (0)
    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.