scientific article; zbMATH DE number 3349645
From MaRDI portal
Publication:5624995
zbMath0219.90046MaRDI QIDQ5624995
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Solving matching problems with linear programming, BIRNBAUM CRITICALITY AND IMPORTANCE MEASURES FOR MULTISTATE SYSTEMS WITH REPAIRABLE COMPONENTS, Recent developments in maximum flow algorithms, Packings by Complete Bipartite Graphs, A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm, Linear-Time Approximation for Maximum Weight Matching, Minimum Cuts and Sparsification in Hypergraphs, Unnamed Item, A complete characterization of the path layout construction problem for ATM networks with given hop count and load, Hypergraph Cuts with General Splitting Functions, Blocking trails for \(f\)-factors of multigraphs, On implementing push-relabel method for the maximum flow problem, Generalized max flows and augmenting paths, Maximum weighted induced forests and trees: new formulations and a computational comparative review, Branch‐and‐cut algorithms for the ‐arborescence star problem, ReLU neural networks of polynomial size for exact maximum flow computation, Algorithms for Multiterminal Cuts, Maximum skew-symmetric flows, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Unnamed Item, Generalized cut trees for edge-connectivity, The resilience of conjunctive queries with inequalities, The computational complexity of optimal blocking of vertices in the digraph, A submodular optimization problem with side constraints, A strongly polynomial time algorithm for a constrained submodular optimization problem, Unnamed Item, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Degree-constrained orientations of embedded graphs, Computing Nash equilibria for scheduling on restricted parallel links, Cycle-connected mixed graphs and related problems, Cycle-connected mixed graphs and related problems, Unnamed Item, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Close-to-optimal algorithm for rectangular decomposition of 3D shapes, On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths, Unnamed Item, Decomposition algorithms for minimal cut problems, Implementing Goldberg's max-flow-algorithm ? A computational investigation, Decomposition algorithms for locating minimal cuts in a network, Fast Augmenting Paths by Random Sampling from Residual Graphs, Stackelberg bipartite vertex cover and the preflow algorithm, A strongly polynomial minimum cost circulation algorithm, Scaling algorithms for network problems, Two-edge connected spanning subgraphs and polyhedra, Minimum cuts in geometric intersection graphs, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, On computing minimum\((s,t)\)-cuts in digraphs, A generalization of the scaling max-flow algorithm, A fast cost scaling algorithm for submodular flow, An extension of Hall's theorem for partitioned bipartite graphs, Quick max-flow algorithm, Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems, On the complexity of the maximum satisfiability problem for Horn formulas, Approximation algorithms for treewidth, An application of simultaneous diophantine approximation in combinatorial optimization, On perfectly two-edge connected graphs, An auction algorithm for the max-flow problem, On the efficiency of maximum-flow algorithms on networks with small integer capacities, Matching and scheduling of student-company-talks for a university it-speed dating event, The parallel complexity of finding a blocking flow in a 3-layer network, A multifacility location problem on median spaces, Enhanced instance space analysis for the maximum flow problem, A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks, On the diameter of partition polytopes and vertex-disjoint cycle cover, Minimum cut problem using bases of extended polymatroids, A parametric maximum flow algorithm for bipartite graphs with applications, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, The directed subgraph homeomorphism problem, Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs, On the fractionality of the path packing problem, Max-flow min-cut theorems on dispersion and entropy measures for communication networks, The subgraph homeomorphism problem, Matchability and \(k\)-maximal matchings, Pattern matching with wildcards and length constraints using maximum network flow, Algebraic flows in regular matroids, Heuristic and exact algorithms for minimum-weight non-spanning arborescences, Search for all \(d\)-mincuts of a limited-flow network, An \(O(EV\log^2V)\) algorithm for the maximal flow problem, The maximum flow problem of uncertain network, An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem, Aggregation of monotone reciprocal relations with application to group decision making, On the theoretical efficiency of various network flow algorithms, The symbolic algorithms for maximum flow in networks, Enumerating \(k\)-arc-connected orientations, Optimal cocircuits in regular matroids and applications, Learning block-preserving graph patterns and its application to data mining, A simple reduction from maximum weight matching to maximum cardinality matching, The saga of minimum spanning trees, Graph connectivity, partial words, and a theorem of Fine and Wilf, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Selecting a discrete portfolio, Worst case behavior of the Dinic algorithm, Partition-based logical reasoning for first-order and propositional theories, On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem, Deciding bisimilarity and similarity for probabilistic processes., Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints, Finding minimum-cost flows by double scaling, Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs, Forests, frames, and games: Algorithms for matroid sums and applications, New scaling algorithms for the assignment and minimum mean cycle problems, A new approach for solving the network problems, A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, Matching theory -- a sampler: From Dénes König to the present, Two scheduling problems with fuzzy due-dates, Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods, Minimum flow problem on network flows with time-varying bounds, Maximum bipartite flow in networks with adaptive channel width, On survivable network polyhedra, A new strategy for the undirected two-commodity maximum flow problem, Structural and algorithmic properties for parametric minimum cuts, Some properties of deadlock detection and recovery in readers and writers problems, Image segmentation by iterative optimization of multiphase multiple piecewise constant model and Four-Color relabeling, Simple and improved parameterized algorithms for multiterminal cuts, A note on degree-constrained star subgraphs of bipartite graphs, Polymatroidal flows with lower bounds, Maximum outflow in generalized flow networks, Exact localisations of feedback sets, An \(O(IVI^3)\) algorithm for finding maximum flows in networks, Numerical investigations on the maximal flow algorithm of Karzanov, A parallel algorithm for finding a blocking flow in an acyclic network, A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, An FPT algorithm for edge subset feedback edge set, Computational investigations of maximum flow algorithms, Solving combinatorial problems with combined min-max-min-sum objective and applications, Parallel algorithm to find maximum capacity paths, A data structure for dynamic trees, The \(\alpha\)-maximum flow model with uncertain capacities, A simple version of Karzanov's blocking flow algorithm, Testing membership in matroid polyhedra, Finding feasible vectors of Edmonds-Giles polyhedra, An algorithmic study of the maximum flow problem: A comparative statistical analysis, Critical extreme points of the 2-edge connected spanning subgraph polytope, A new saling algorithm for the maximum mean cut problem, Network flow and 2-satisfiability, Algorithms and complexity analysis for some flow problems, Approximate binary search algorithms for mean cuts and cycles, The maximum flow problem: A max-preflow approach, Approximate congruence in nearly linear time, New approximability results for two-dimensional bin packing
