Augmenting undirected node-connectivity by one

DOI10.1145/1806689.1806767MaRDI QIDQ2875183zbMATH OpenOpenAlexFDO

Authors László A. Végh

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1806689.1806767

zbMATH Keywords

connectivity augmentationnode-connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Augmenting undirected node-connectivity by one
• An algorithm to increase the node-connectivity of a digraph by one
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• scientific article; zbMATH DE number 1263261
• Connectivity augmentation of graphs

Cited in

(10)

• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
• Node connectivity augmentation via iterative randomized rounding
• Augmenting weighted graphs to establish directed point-to-point connectivity
• Approximating node-connectivity augmentation problems
• An algorithm to increase the node-connectivity of a digraph by one
• Tri-connectivity augmentation in trees
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• Successive edge-connectivity augmentation problems
• Augmenting undirected node-connectivity by one

This page was built for publication: Augmenting undirected node-connectivity by one

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