Pages that link to "Item:Q5495847"
From MaRDI portal
The following pages link to Max flows in O(nm) time, or better (Q5495847):
Displaying 50 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Improved balanced flow computation using parametric flow (Q284342) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Integrating security constraints into fixed priority real-time schedulers (Q298053) (← links)
- Robust scheduling of wireless sensor networks for target tracking under uncertainty (Q322906) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
- First-order dominance: stronger characterization and a bivariate checking algorithm (Q1717226) (← links)
- Algorithms and bounds for drawing directed graphs (Q1725793) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Exact solution of hub network design problems with profits (Q1754057) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Graphs with no \(K_{3,3}\) minor containing a fixed edge (Q1953665) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Lexicographic optimal homologous chains and applications to point cloud triangulations (Q2105327) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Enhanced instance space analysis for the maximum flow problem (Q2171589) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (Q2321275) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- Dynamic network flow location models and algorithms for quickest evacuation planning (Q2666700) (← links)
