Sciweavers

    ISAAC
    2007
    Springer
    183views Algorithms» more  ISAAC 2007»
    The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
    13 years 10 months ago
    The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
    Download  www.imsc.res.in
    The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
    Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
    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.