A Fast Algorithm for Optimally Increasing the Edge Connectivity
From MaRDI portal
Publication:4376163
DOI10.1137/S0097539792234226zbMath0884.05082OpenAlexW2142542622MaRDI QIDQ4376163
Dalit Naor, Dan Gusfield, Charles U. Martel
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792234226
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (12)
A note on minimizing submodular functions ⋮ Canonical cactus representation for miminum cuts ⋮ Minimum degree orderings ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ Unnamed Item ⋮ Minimizing a monotone concave function with laminar covering constraints ⋮ A CACTUS THEOREM FOR END CUTS ⋮ A fast algorithm for cactus representations of minimum cuts ⋮ Augmenting trees so that every three vertices lie on a cycle ⋮ Approximation algorithms for graph augmentation ⋮ The Common Structure of the Curves Having a Same Gauss Word ⋮ A new saling algorithm for the maximum mean cut problem
This page was built for publication: A Fast Algorithm for Optimally Increasing the Edge Connectivity
