Pages that link to "Item:Q3158520"

The following pages link to Beyond the flow decomposition barrier (Q3158520):

Displaying 50 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Inverse feasibility problems of the inverse maximum flow problems (Q261056) (← links)
• Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
• The minimum vulnerability problem on specific graph classes (Q346526) (← links)
• Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
• Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
• Finding paths with minimum shared edges (Q386426) (← links)
• On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
• The minimum vulnerability problem (Q487032) (← links)
• Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
• Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
• Approximate string matching with stuck address bits (Q551176) (← links)
• Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' (Q611943) (← links)
• Multiindex optimal production planning problems (Q612224) (← links)
• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
• Three-index linear programs with nested structure (Q664295) (← links)
• Chips on wafers, or packing rectangles into grids (Q705545) (← links)
• A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
• Minimizing a sum of submodular functions (Q713320) (← links)
• Multicommodity flows in tree-like networks (Q733946) (← links)
• Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
• Minimum cut bases in undirected networks (Q968141) (← links)
• Low-energy excitations in the three-dimensional random-field Ising model (Q978939) (← links)
• Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
• A new algorithm for solving the feasibility problem of a network flow (Q990544) (← links)
• Finding a feasible flow in a strongly connected network (Q1003481) (← links)
• Executability of scenarios in Petri nets (Q1006647) (← links)
• Orthogonal layout with optimal face complexity (Q1616241) (← links)
• A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks (Q1673339) (← links)
• Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
• A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity (Q1717975) (← links)
• The traveling purchaser problem and its variants (Q1751767) (← links)
• A computational study of the capacity scaling algorithm for the maximum flow problem (Q1761224) (← links)
• A generalization of the scaling max-flow algorithm (Q1885993) (← links)
• Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
• Network flow methods for the minimum covariate imbalance problem (Q2116900) (← links)
• SSE and SSD: page-efficient searchable symmetric encryption (Q2128993) (← links)
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
• Fair-by-design matching (Q2212506) (← links)
• A distributed mincut/maxflow algorithm combining path augmentation and push-relabel (Q2254255) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
• A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
• Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
• Determining the circular flow number of a cubic graph (Q2656904) (← links)
• Minimax inverse problems of minimum cuts (Q2782726) (← links)
• On multiroute maximum flows in networks (Q2782731) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
• GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)