Sciweavers

    FCT
    2009
    Springer
    146views Applied Computing» more  FCT 2009»
    Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
    13 years 8 months ago
    Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
    Download  theorie.informatik.uni-ulm.de
    We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
    Thomas Thierauf, Fabian Wagner
    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.