Very Simple Methods for All Pairs Network Flow Analysis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1919454
- Common aspects of several network flow algorithms
- The flow network method
- Two flow network simplification algorithms
- scientific article; zbMATH DE number 1759406
- Publication:3033215
- Efficient method of analyzing network branching
- Computing and Combinatorics
- scientific article; zbMATH DE number 5997367
- Static flows in networks
Cited in
(45)- On spanning tree congestion of graphs
- A decomposition algorithm for multi-terminal network flows
- Ancestor tree for arbitrary multi-terminal cut functions
- Extracting maximal information about sets of minimum cuts
- Designing multi-commodity flow trees
- Dynamic programming and graph optimization problems
- Ordered weighted average optimization in multiobjective spanning tree problem
- Parametric min-cuts analysis in a network.
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- Coordinating resources in Stackelberg security games
- Mincut sensitivity data structures for the insertion of an edge
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Parametric analysis on cut-trees and its application on a protein clustering problem
- Multi-depot rural postman problems
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Optimizing compatible sets in wireless networks through integer programming
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- An algorithm for computing maximum solution bases
- Continuous maximal covering location problems with interconnected facilities
- Impact of a varying capacity on the all pairs 2-route network flows
- Efficient algorithm for computing all low s-t edge connectivities in directed graphs
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Tight Bounds for Gomory-Hu-like Cut Counting
- On the collaboration uncapacitated arc routing problem
- On a Special Co-cycle Basis of Graphs
- Sensitivity analysis of 0-1 multiterminal network flows
- scientific article; zbMATH DE number 2079418 (Why is no real title available?)
- Designing multi-commodity flow trees
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
- New algorithms and lower bounds for all-pairs max-flow in undirected graphs
- Mincut Sensitivity Data Structures for the Insertion of an Edge
- Dynamic Graph Clustering Using Minimum-Cut Trees
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
- The all-pairs vitality-maximization (VIMAX) problem
- Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows
- Design of survivable networks with low connectivity requirements
- Distributional limits of graph cuts on discretized grids
- High-speed minimum cut approximation in dense graph using compacted pruned tree
- A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- On the restricted Steiner multi cycle problem
- Properties of Gomory-Hu co-cycle bases
- Design of survivable IP-over-optical networks
- Minimum cut bases in undirected networks
This page was built for publication: Very Simple Methods for All Pairs Network Flow Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496127)
