Sciweavers

    62
    Voted
    COCOON
    2007
    Springer
    104views Combinatorics» more  COCOON 2007»
    On the Complexity of Finding an Unknown Cut Via Vertex Queries
    15 years 3 months ago
    On the Complexity of Finding an Unknown Cut Via Vertex Queries
    Download  cg.scs.carleton.ca
    We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
    Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
    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-2025, USA.