A strong-connectivity algorithm and its applications in data flow analysis
From MaRDI portal
Publication:1144380
DOI10.1016/0898-1221(81)90008-0zbMath0443.68046OpenAlexW2075410688MaRDI QIDQ1144380
Publication date: 1981
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(81)90008-0
strongly connected componentslinear algorithmHecht-Ullman algorithmiterative solution of data-flow analysis problems
Related Items
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs, Weighted digraphs and tropical cones, Algebraic Investigation of Connected Components, Path-based depth-first search for strong and biconnected components, The complexity of shelflisting, Reachability preserving compression for dynamic graph, Algorithms for dense graphs and networks on the random access computer, Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles, A tie-break model for graph search, Sharp Thresholds in Random Simple Temporal Graphs, Efficient presolving methods for the influence maximization problem, Semi-external LTL Model Checking, Construction of discontinuous piecewise quadratic value functions in a target control problem, Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, Unnamed Item, An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton, Symbolic coloured SCC decomposition, On the Computational Complexity of Non-Dictatorial Aggregation, Toward leaner binary-clause reasoning in a satisfiability solver, Unnamed Item, Physically feasible decomposition of Engino® toy models: A graph-theoretic approach, Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems, An Incremental Bisimulation Algorithm, Monotone bargaining is Nash-solvable, A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time, Finding strongly connected components of simple digraphs based on granulation strategy, Sequence graphs: characterization and counting of admissible elements, An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton, Concurrent disjoint set union, Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means, An algorithm for computing the spectral radius of nonnegative tensors, More efficient on-the-fly LTL verification with Tarjan's algorithm, On finding the strongly connected components in a directed graph
Cites Work
