Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Hiroshi Nagamochi, Toshihide Ibaraki · SIAM Journal on Discrete Mathematics · 1992 · 395 citations

Computing, Computer Science, Algorithms +12

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Hiroshi Nagamochi, Toshihide Ibaraki · Algorithmica · 1992 · 365 citations

Computing, Computer Science, Topology +4

Augmenting Graphs to Meet Edge-Connectivity Requirements

András Frank · SIAM Journal on Discrete Mathematics · 1992 · 253 citations

Natural Sciences, Computer Science, Mathematics +14

Augmenting graphs to meet edge-connectivity requirements

András Frank · 2002 · 217 citations

Natural Sciences, Computer Science, Mathematics +14

Locating Sources to Meet Flow Demands in Undirected Networks

Kouji Arata, Satoru Iwata, Kazuhisa Makino et al. · Journal of Algorithms · 2002 · 45 citations

Computing, Transportation Planning, Computer Networks +10