A strong-connectivity algorithm and its applications in data flow analysis
From MaRDI portal
Cites work
- A Simple Algorithm for Global Data Flow Analysis Problems
- A survey of motion planning and related geometric algorithms
- Global Data Flow Analysis and Iterative Algorithms
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3557197 (Why is no real title available?)
Cited in
(50)- On finding the strongly connected components in a directed graph
- Toward leaner binary-clause reasoning in a satisfiability solver
- Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems
- Monotone bargaining is Nash-solvable
- Algorithms for dense graphs and networks on the random access computer
- An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
- Sequence graphs: characterization and counting of admissible elements
- Concurrent disjoint set union
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
- Symbolic coloured SCC decomposition
- Finding strongly connected components of simple digraphs based on granulation strategy
- An algorithm for computing the spectral radius of nonnegative tensors
- More efficient on-the-fly LTL verification with Tarjan's algorithm
- The complexity of shelflisting
- Reachability preserving compression for dynamic graph
- Construction of discontinuous piecewise quadratic value functions in a target control problem
- Weighted digraphs and tropical cones
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Path-based depth-first search for strong and biconnected components
- Dominated parasitic flow loops in networks
- Semi-external LTL Model Checking
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
- Edmonds-Karp
- Flow Networks
- Gabow SCC
- Efficient computation of the large inductive dimension using order- and graph-theoretic means
- scientific article; zbMATH DE number 7566051 (Why is no real title available?)
- On the computational complexity of non-dictatorial aggregation
- Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach
- Algebraic investigation of connected components
- Prpu_Maxflow
- An Incremental Bisimulation Algorithm
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
- Sharp Thresholds in Random Simple Temporal Graphs
- Efficient presolving methods for the influence maximization problem
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
- The Choice Construct in the Soufflé Language
- A truly symbolic linear-time algorithm for SCC decomposition
- Compositional techniques for Boolean networks and attractor analysis
- Finding strong components using depth-first search
- Automating the stable rank computation for special biserial algebras
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
- The index and core of a relation. With applications to the axiomatics of relation algebra
- Fully dynamic strongly connected components in planar digraphs
- Faster graph algorithms through DAG compression
- Core stability and strategy-proofness in hedonic coalition formation problems with friend-oriented preferences
- Linear-time safe-alternating DFS and SCCs
- A characterization of irreducible tensors by using the connectedness of the associated directed hypergraphs
- A general framework for finding diverse solutions via network flow and its applications
- A tie-break model for graph search
This page was built for publication: A strong-connectivity algorithm and its applications in data flow analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144380)
