Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs

DOI10.1002/net.21943OpenAlexW3023596911MaRDI QIDQ6092652

No author found.

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21943

zbMATH Keywords

graph partitioningdirected graphsnetwork flowminimum cutssymmetric cutsall-pairs minimum cutflow cutreplication cut

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs
• Recent directions in netlist partitioning: a survey
• On a function for the vulnerability of a directed flow network
• Multi-Terminal Network Flows
• Conditional Lower Bounds for All-Pairs Max-Flow
• Counterexamples for Directed and Node Capacitated Cut-Trees
• Random Graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs