Flow Graph Reducibility
From MaRDI portal
Cited in
(28)- Efficient symbolic analysis of programs
- On locating minimum feedback vertex sets
- The directed subgraph homeomorphism problem
- Pathlistings applied to data flow analysis
- Translatability of flowcharts into while programs
- Analysis of structured programs
- Testing flow graph reducibility
- Function iteration logics and flowchart schemata
- Node listings for reducible flow graphs
- Correctness of parallel programs: The Church-Rosser approach
- Profitability computations on program flow graphs
- A semantically meaningful characterization of reducible flowchart schemes
- Algebraic and graph theoretic characterizations of structured flowchart schemes
- Solving problems for maximal reducible flowgraphs.
- On the resilience of canonical reducible permutation graphs
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
- Fast algorithms for the elimination of common subexpressions
- A generalized mathematical theory of structured programming
- Full characterization of a class of graphs tailored for software watermarking
- Packing feedback arc sets in reducible flow graphs
- Flow Hypergraph Reducibility
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
- Applications of graph theory in computer systems
- Boolean-valued loops
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden'
- Flow hypergraph reducibility
- Algebraic characterization of reducible flowcharts
- Properties of data flow frameworks: A unified model
This page was built for publication: Flow Graph Reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681535)
