Sciweavers

    2 search results - page 1 / 1
    » Covering Two-Edge-Coloured Complete Graphs with Two Disjoint...
    Sort
    View
    CPC
    2008
    114views more  CPC 2008»
    Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
    13 years 4 months ago
    Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
    Download  www.cdam.lse.ac.uk
    In 1998 Luczak, R
    Peter Allen
    claim paper
    Read More »
    NETWORKS
    2007
    90views Computer Networks» more  NETWORKS 2007»
    Vertex disjoint routings of cycles over tori
    13 years 4 months ago
    Vertex disjoint routings of cycles over tori
    Download  hal.archives-ouvertes.fr
    We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
    Jean-Claude Bermond, Min-Li Yu
    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.