Incremental algorithm for minimum cut and edge connectivity in hypergraph

DOI10.1007/978-3-030-25005-8_20OpenAlexW2957906495MaRDI QIDQ2301748

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)

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