Sciweavers

    2 search results - page 1 / 1
    » Approximating clique-width and branch-width
    Sort
    View
    WG
    2005
    Springer
    90views Theoretical Computer Science» more  WG 2005»
    Approximating Rank-Width and Clique-Width Quickly
    13 years 10 months ago
    Approximating Rank-Width and Clique-Width Quickly
    Download  mathsci.kaist.ac.kr
    Sang-il Oum
    claim paper
    Read More »
    TAMC
    2010
    Springer
    216views Applied Computing» more  TAMC 2010»
    Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
    13 years 3 months ago
    Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
    Download  www.ii.uib.no
    Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
    Pinar Heggernes, Daniel Meister, Udi Rotics
    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.