Sciweavers

    DAM
    2002
    82views more  DAM 2002»
    On the computational complexity of strong edge coloring
    14 years 5 days ago
    On the computational complexity of strong edge coloring
    Download  www.mahdian.org
    In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
    Mohammad Mahdian
    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.