Pages that link to "Item:Q3885550"

The following pages link to On the structure of all minimum cuts in a network and applications (Q3885550):

Displaying 44 items.

• The maximum flow problem with disjunctive constraints (Q358660) (← links)
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
• On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
• Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
• Most balanced minimum cuts (Q968139) (← links)
• An algorithm to generate the ideals of a partial order (Q1086160) (← links)
• Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations (Q1100219) (← links)
• Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
• An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
• A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
• A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
• Representation of lattices via set-colored posets (Q1800386) (← links)
• Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
• Fair-by-design matching (Q2212506) (← links)
• A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
• A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system (Q2327387) (← links)
• Discrete Newton methods for the evacuation problem (Q2330131) (← links)
• Polyhedral computational geometry for averaging metric phylogenetic trees (Q2348943) (← links)
• Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
• Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
• Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
• A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
• Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• Finding all minimum-size separating vertex sets in a graph (Q3141110) (← links)
• Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
• Characterization of all optimal solutions and parametric maximal mows in networks (Q3683846) (← links)
• Calculating bounds on reachability and connectedness in stochastic networks (Q3686053) (← links)
• Boolean sublattices connected with minimization problems on matroids (Q3922500) (← links)
• Efficient algorithms for generalized cut‐trees (Q3978604) (← links)
• Maximizing residual flow under an arc destruction (Q4537607) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• Threshold reliability of networks with small failure sets (Q4838201) (← links)
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
• Suboptimal cuts: Their enumeration, weight and number (Q5204331) (← links)
• Mincut Sensitivity Data Structures for the Insertion of an Edge (Q5874478) (← links)
• (Q5874530) (← links)
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784) (← links)
• Lexicographically optimal earliest arrival flows (Q6068531) (← links)
• On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)