Augmenting edge-connectivity between vertex subsets (Q472470): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Covering symmetric supermodular functions by graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Splitting-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient splitting off algorithms for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation algorithm for connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization) / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity and its augmentation: Applications of MA orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Transversals in Posimodular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation of graphs over symmetric parity families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Connectivity Augmentations of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank

Latest revision as of 07:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Augmenting edge-connectivity between vertex subsets
scientific article

    Statements

    Augmenting edge-connectivity between vertex subsets (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    edge-connectivity
    0 references
    modulotone function
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references