Edge-connectivity augmentation problems

Authors
Publication date
1987
Publisher
Published by Elsevier Inc.
Doi

    Abstract

    AbstractWe give a characterization on the minimum number of edges to be added so as to k-edge-connect a graph. We also show that such a minimum edge set can be determined in O(kL|V|4 (k|V| + |E|)) time for any graph G = (V E) and any fixed k≧2, where L = min {k, | V |

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    Last time updated on 05/06/2019

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.