Edge connectivity between nodes and node-subsets

DOI10.1002/(SICI)1097-0037(199805)31:3%3C157::AID-NET2%3E3.0.CO;2-EMaRDI QIDQ4540043zbMATH OpenOpenAlexFDO

Authors Hiro Ito, Mitsuo Yokoyama

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199805)31:3%3C157::aid-net2%3E3.0.co;2-e

Mathematics Subject Classification ID

Connectivity (05C40) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 2080258
• Augmenting edge-connectivity between vertex subsets
• NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
• Mathematical Foundations of Computer Science 2003
• Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

Cited in

(11)

• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• The source location problem with local 3-vertex-connectivity requirements
• The root location problem for arc-disjoint arborescences
• scientific article; zbMATH DE number 2080258 (Why is no real title available?)
• NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
• Maximum-cover source location problems with objective edge-connectivity three
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
• Source location with rigidity and tree packing requirements
• Minimum cost source location problem with local 3-vertex-connectivity requirements
• Minimizing a monotone concave function with laminar covering constraints

This page was built for publication: Edge connectivity between nodes and node-subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540043)