Incremental algorithm for minimum cut and edge connectivity in hypergraph

DOI10.1007/978-3-030-25005-8_20MaRDI QIDQ2301748zbMATH OpenOpenAlexFDO

Authors Rahul Raj Gupta, Sushanta Karmakar

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_20

zbMATH Keywords

hypergraphminimum cutedge connectivityhypercactus

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Computing minimum cuts in hypergraphs
• Minimum cuts and sparsification in hypergraphs
• Incremental exact min-cut in polylogarithmic amortized update time
• scientific article; zbMATH DE number 6846417
• Fully-dynamic MIN-cut

Cited in

(2)

• scientific article; zbMATH DE number 6846417 (Why is no real title available?)
• scientific article; zbMATH DE number 1263227 (Why is no real title available?)

This page was built for publication: Incremental algorithm for minimum cut and edge connectivity in hypergraph

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