Sciweavers

    ALGORITHMICA
    2006
    138views more  ALGORITHMICA 2006»
    Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
    13 years 11 months ago
    Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
    Download  www.dur.ac.uk
    We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
    Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
    claim paper
    Read More »
    GG
    2010
    Springer
    139views Theoretical Computer Science» more  GG 2010»
    Verification of Graph Transformation Systems with Context-Free Specifications
    13 years 11 months ago
    Verification of Graph Transformation Systems with Context-Free Specifications
    Download  wwwbrauer.informatik.tu-muenchen.de
    We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
    Barbara König, Javier Esparza
    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.