A strong-connectivity algorithm and its applications in data flow analysis
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3557197 (Why is no real title available?)
- 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
Cited in
(37)- Toward leaner binary-clause reasoning in a satisfiability solver
- Reachability preserving compression for dynamic graph
- Sharp Thresholds in Random Simple Temporal Graphs
- An Incremental Bisimulation Algorithm
- scientific article; zbMATH DE number 7566051 (Why is no real title available?)
- An algorithm for computing the spectral radius of nonnegative tensors
- Finding strong components using depth-first search
- Weighted digraphs and tropical cones
- Semi-external LTL Model Checking
- Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach
- Efficient presolving methods for the influence maximization problem
- Symbolic coloured SCC decomposition
- Efficient computation of the large inductive dimension using order- and graph-theoretic means
- On finding the strongly connected components in a directed graph
- On the computational complexity of non-dictatorial aggregation
- Monotone bargaining is Nash-solvable
- Path-based depth-first search for strong and biconnected components
- Construction of discontinuous piecewise quadratic value functions in a target control problem
- The complexity of shelflisting
- Dominated parasitic flow loops in networks
- Algorithms for dense graphs and networks on the random access computer
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- A tie-break model for graph search
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
- Sequence graphs: characterization and counting of admissible elements
- Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
- The Choice Construct in the Soufflé Language
- Concurrent disjoint set union
- Finding strongly connected components of simple digraphs based on granulation strategy
- A truly symbolic linear-time algorithm for SCC decomposition
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
- Algebraic investigation of connected components
- More efficient on-the-fly LTL verification with Tarjan's algorithm
- Compositional techniques for Boolean networks and attractor analysis
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)
