The following pages link to (Q5624995):
Displaying 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- Aggregation of monotone reciprocal relations with application to group decision making (Q429412) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Selecting a discrete portfolio (Q478119) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- Maximum outflow in generalized flow networks (Q583080) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints (Q666171) (← links)
- Minimum flow problem on network flows with time-varying bounds (Q693577) (← links)
- A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
- Quick max-flow algorithm (Q841606) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Pattern matching with wildcards and length constraints using maximum network flow (Q891817) (← links)
- The maximum flow problem of uncertain network (Q903658) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- The parallel complexity of finding a blocking flow in a 3-layer network (Q1119019) (← links)
- A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980) (← links)
- The directed subgraph homeomorphism problem (Q1132111) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Algebraic flows in regular matroids (Q1138993) (← links)
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem (Q1147636) (← links)
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem (Q1151034) (← links)
- On the theoretical efficiency of various network flow algorithms (Q1154258) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Worst case behavior of the Dinic algorithm (Q1180321) (← links)
