Maximal k-edge-connected subgraphs in weighted graphs via local random contraction

DOI10.1137/1.9781611977554.CH8MaRDI QIDQ6538534zbMATH OpenFDO

Authors Chaitanya Nalam, Thatchaphol Saranurak

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH8

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• On maximal k-edge-connected subgraphs of undirected graphs
• Efficient contractions of dynamic graphs -- with applications
• A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system

This page was built for publication: Maximal \(k\)-edge-connected subgraphs in weighted graphs via local random contraction

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