Sciweavers

    114
    Voted
    COCOON
    1999
    Springer
    109views Combinatorics» more  COCOON 1999»
    On the Complexity of Approximating Colored-Graph Problems
    15 years 9 months ago
    On the Complexity of Approximating Colored-Graph Problems
    Download  www.mat.uniroma2.it
    Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...
    claim paper
    Read More »
    145
    Voted
    COCOON
    1999
    Springer
    142views Combinatorics» more  COCOON 1999»
    On Routing in Circulant Graphs
    15 years 9 months ago
    On Routing in Circulant Graphs
    Download  www.cs.ust.hk
    We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
    Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
    claim paper
    Read More »
    111
    Voted
    COCOON
    1999
    Springer
    131views Combinatorics» more  COCOON 1999»
    On Bounds for the k-Partitioning of Graphs
    15 years 9 months ago
    On Bounds for the k-Partitioning of Graphs
    Download  mcs.uwsuper.edu
    Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete...
    claim paper
    Read More »
    « first‹ previous12
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.