Tight lower bounds for the number of inclusion-minimal \(st\)-cuts

DOI10.1007/978-3-030-00256-5_9OpenAlexW2888814542MaRDI QIDQ1627159

Romeo Rizzi, Roberto Grossi, Takeaki Uno, Luca Versari, Andrea Marino, Alessio Conte

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-00256-5_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay

This page was built for publication: Tight lower bounds for the number of inclusion-minimal \(st\)-cuts