Beyond the flow decomposition barrier
From MaRDI portal
Publication:3158520
DOI10.1145/290179.290181zbMath1064.90567OpenAlexW2099463627WikidataQ56018627 ScholiaQ56018627MaRDI QIDQ3158520
No author found.
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/290179.290181
Related Items (77)
Orthogonal layout with optimal face complexity ⋮ Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Minimum Cuts in Surface Graphs ⋮ SSE and SSD: page-efficient searchable symmetric encryption ⋮ Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ A generalization of the scaling max-flow algorithm ⋮ Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ Separation, dimension, and facet algorithms for node flow polyhedra ⋮ Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ The maximum flow problem in a network with special conditions of flow distribution ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Computing Weighted Strength and Applications to Partitioning ⋮ The minimum vulnerability problem on specific graph classes ⋮ Cycle-based reducibility of multi-index transport-type systems of linear inequalities ⋮ Determining the circular flow number of a cubic graph ⋮ Simplifications and speedups of the pseudoflow algorithm ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Finding paths with minimum shared edges ⋮ Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' ⋮ Multiindex optimal production planning problems ⋮ Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ A fast maximum flow algorithm ⋮ Algorithms for Multiterminal Cuts ⋮ On flows in simple bidirected and skew-symmetric networks ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities ⋮ On a Special Co-cycle Basis of Graphs ⋮ Even faster parameterized cluster deletion and cluster editing ⋮ Solving mean-payoff games via quasi dominions ⋮ Fair-by-design matching ⋮ Morphological decomposition and compression of binary images via a minimum set cover algorithm ⋮ A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity ⋮ An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem ⋮ A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem ⋮ GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE ⋮ Three-index linear programs with nested structure ⋮ The minimum vulnerability problem ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Approximating Bicolored Images from Discrete Projections ⋮ The traveling purchaser problem and its variants ⋮ PERMUTATIONAL METHODS FOR PERFORMANCE ANALYSIS OF STOCHASTIC FLOW NETWORKS ⋮ A distributed mincut/maxflow algorithm combining path augmentation and push-relabel ⋮ A computational study of the capacity scaling algorithm for the maximum flow problem ⋮ Minimum cut bases in undirected networks ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ Multi-index transport problems with decomposition structure ⋮ Approximate string matching with stuck address bits ⋮ Unnamed Item ⋮ Chips on wafers, or packing rectangles into grids ⋮ Low-energy excitations in the three-dimensional random-field Ising model ⋮ A new strategy for the undirected two-commodity maximum flow problem ⋮ On project scheduling with irregular starting time costs ⋮ Minimizing a sum of submodular functions ⋮ Minimax inverse problems of minimum cuts ⋮ On multiroute maximum flows in networks ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ Unnamed Item ⋮ A new algorithm for solving the feasibility problem of a network flow ⋮ Multicommodity flows in tree-like networks ⋮ Finding a feasible flow in a strongly connected network ⋮ Executability of scenarios in Petri nets ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem ⋮ Close-to-optimal algorithm for rectangular decomposition of 3D shapes ⋮ Properties of Gomory-Hu co-cycle bases ⋮ Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors ⋮ Near-Optimal Distributed Maximum Flow ⋮ Network flow methods for the minimum covariate imbalance problem ⋮ Degree-constrained graph orientation: maximum satisfaction and minimum violation ⋮ Inverse feasibility problems of the inverse maximum flow problems
This page was built for publication: Beyond the flow decomposition barrier
