Network Flow and Testing Graph Connectivity
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Cycle-connected mixed graphs and related problems
- Cycle-connected mixed graphs and related problems
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- A simple criterion for structurally fixed modes
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- Path-contractions, edge deletions and connectivity preservation
- Recent developments in maximum flow algorithms
- scientific article; zbMATH DE number 1769330 (Why is no real title available?)
- A probabilistic algorithm for vertex connectivity of graphs
- An improved algorithm for decomposing arc flows into multipath flows
- A combinatorial algorithm for weighted stable sets in bipartite graphs
- Maximum flow and minimum-cost flow in almost-linear time
- Parallel algorithm to find maximum capacity paths
- Connectivity properties in random regular graphs with edge faults
- The subgraph homeomorphism problem
- A simple variant of node connectivity is NP-complete
- Depth First Search in the Semi-streaming Model
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
- Efficient algorithm for the vertex connectivity of trapezoid graphs
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Same stats, different graphs (graph statistics and why we need graph drawings)
- Network reliability in Hamiltonian graphs
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Minimum cuts in geometric intersection graphs
- On computing minimum(s,t)-cuts in digraphs
- Scheduling unit-time jobs on processors with different capabilities
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
- Approximating minimum cuts under insertions
- scientific article; zbMATH DE number 7561367 (Why is no real title available?)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Graph invariants and large cycles: a survey
- The clique-perfectness and clique-coloring of outer-planar graphs
- Maximum bipartite flow in networks with adaptive channel width
- Output-sensitive reporting of disjoint paths (extended abstract)
- Improved algorithms for graph four-connectivity
- Efficient algorithm for computing all low s-t edge connectivities in directed graphs
- Orthogonal layout with optimal face complexity
- Approximating the treewidth of AT-free graphs.
- On flows in simple bidirected and skew-symmetric networks
- Bottleneck flows in unit capacity networks
- Pattern matching with wildcards and length constraints using maximum network flow
- A faster parallel algorithm for k-connectivity
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- A graph-theoretic characterization for the rank of the transfer matrix of structured system
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- Uniformly connected graphs
- Scaling algorithms for network problems
- A constructive arboricity approximation scheme
- scientific article; zbMATH DE number 7559206 (Why is no real title available?)
- Finding hidden independent sets in interval graphs
- Ranking intervals under visibility constraints∗
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Faster algorithms for semi-matching problems
- Incremental assignment problem
- Forests, frames, and games: Algorithms for matroid sums and applications
- New scaling algorithms for the assignment and minimum mean cycle problems
- Systems of distinct representatives for k families of sets
- On orienting graphs for connectivity: Projective planes and Halin graphs
- A weight-scaling algorithm for \(f\)-factors of multigraphs
- Blocking trails for \(f\)-factors of multigraphs
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Maximum cardinality \(f\)-matching in time \(O(n^{2/3}m)\)
- Extracting maximal information about sets of minimum cuts
- The General Minimum Fill-In Problem
- Maximum skew-symmetric flows
- First-order logic with metric betweenness – the case of non-definability of some graph classes
- Game connectivity of graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
- An approach to the subgraph homeomorphism problem
- A good algorithm for lexicographically optimal flows in multi-terminal networks
- Depth-first search is inherently sequential
- An efficient algorithm to solve connectivity problem on trapezoid graphs
- Partition-based logical reasoning for first-order and propositional theories
- A random NC algorithm for depth first search
- On the theoretical efficiency of various network flow algorithms
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- On the complexity of the maximum satisfiability problem for Horn formulas
- Computing maximum non-crossing matching in convex bipartite graphs
- Explaining robust additive utility models by sequences of preference swaps
- Faster algorithms for rooted connectivity in directed graphs
- Validity of clusters formed by graph-theoretic cluster methods
- Finding a complete matching with the maximum product on weighted bipartite graphs
- A scaling algorithm for weighted f-factors in general graphs
- Finding triconnected components of graphs
- Tree-core and tree-coritivity of graphs
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
- Vertex connectivity in poly-logarithmic max-flows
- Engineering edge orientation algorithms
- Edge-disjoint branching in directed multigraphs
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Computing vertex-disjoint paths in large graphs using MAOs
- Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
This page was built for publication: Network Flow and Testing Graph Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094634)
