Search results
From MaRDI portal
- in directed multigraphs 1979-01-01 Paper Maximum Flow in Planar Networks 1979-01-01 Paper Multi-Terminal 0–1 Flow 1979-01-01 Paper A Minimum Linear Arrangement...10 bytes (16 words) - 09:02, 13 December 2023
- de/entity/Q4263715 1999-09-22 Paper The planar multiterminal cut problem 1998-08-20 Paper Multiterminal flows and cuts 1996-10-20 Paper Generalizing the all-pairs...10 bytes (18 words) - 12:03, 9 December 2023
- Paper Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs 2008-05-16 Paper The maximum integer multiterminal flow problem...10 bytes (16 words) - 12:43, 11 December 2023
- 1986-01-01 Paper Multi-terminal maximum flows in node-capacitated networks 1986-01-01 Paper An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks...10 bytes (17 words) - 18:00, 9 December 2023
- de/entity/Q4252315 1999-06-17 Paper Characterizing multiterminal flow networks and computing flows in networks of small treewidth 1999-02-21 Paper More...10 bytes (17 words) - 20:37, 11 December 2023
- Capacity Expansion in Stochastic Flow Networks 2007-01-19 Paper State‐space partition techniques for multiterminal flows in stochastic networks 2006-09-12...10 bytes (16 words) - 14:18, 24 September 2023
- Paper The approximation of maximum subgraph problems 2019-03-29 Paper Primal-dual approximation algorithms for integral flow and multicut in trees, with...10 bytes (17 words) - 23:51, 11 December 2023
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time 2018-07-16 Paper Local Flow Partitioning for Faster...10 bytes (19 words) - 03:18, 12 December 2023
- of thermal convective flows in two dimensions 2013-07-25 Paper A linear time approximation scheme for computing geometric maximum \(k\)-star 2013-03-25...10 bytes (16 words) - 18:15, 6 October 2023
- mardi4nfdi.de/entity/Q3140441 1994-01-02 Paper Probabilistic Analysis of Network Flow Algorithms 1993-06-29 Paper A Monte-Carlo Algorithm for Estimating the Permanent...10 bytes (19 words) - 05:05, 9 December 2023
- second order accuracy preserving method for moving contact lines with Stokes flow 2022-04-29 Paper Direct probe of dark energy through gravitational lensing...10 bytes (17 words) - 19:48, 11 December 2023
- OREGONATOR SYSTEMS 2009-07-21 Paper SLOW INVARIANT MANIFOLDS AS CURVATURE OF THE FLOW OF DYNAMICAL SYSTEMS 2009-07-21 Paper A NONLINEAR DYNAMICS PERSPECTIVE OF...10 bytes (19 words) - 22:40, 12 December 2023
- Platooning on Highway Congestion 2018-12-06 Paper Distributed Controllers for Multiterminal HVDC Transmission Systems 2018-12-04 Paper Attitude Coordinated Control...10 bytes (19 words) - 14:42, 10 December 2023
- Brave) zbMATH Keywords decomposition algorithm; large networks; multiterminal maximum flow; tri-connected components Mathematics Subject Classification ID...15 bytes (73 words) - 02:05, 31 January 2024
- algorithm; edge insertion algorithm; multiterminal maximum flow problem; random connected graphs; undirected 0-1 flow network Mathematics Subject Classification...15 bytes (100 words) - 00:55, 30 January 2024
- zbMATH Keywords minimum cut; trees; linear-time algorithms; maximum flow; multiterminal flow Mathematics Subject Classification ID 90C35: Programming involving...15 bytes (61 words) - 16:29, 7 February 2024
- complexity; minimum cut; maximum flow; edge connectivity; Gomory-Hu algorithm; connectivity in unsymmetrical networks; multiterminal network flow Mathematics Subject...15 bytes (64 words) - 23:02, 3 February 2024
- \(O(n^ 3)\) max-flow algorithm, A heuristic for blocking flow algorithms, Characterizing multiterminal flow networks and computing flows in networks of...15 bytes (157 words) - 23:42, 5 February 2024
- Structure of Flow in Planar Graphs Maximal Flow Through a Network TWO THEOREMS IN GRAPH THEORY An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected...15 bytes (162 words) - 16:28, 31 January 2024
- Network The maximum concurrent flow problem Solution Bases of Multiterminal Cut Problems Multi-Terminal Network Flows Circular Cuts in a Network An Efficient...15 bytes (115 words) - 06:47, 31 January 2024
