The following pages link to Flow Graph Reducibility (Q5681535):
Displaying 28 items.
- Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' (Q611943) (← links)
- Flow hypergraph reducibility (Q643016) (← links)
- Algebraic characterization of reducible flowcharts (Q789162) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- On locating minimum feedback vertex sets (Q1113681) (← links)
- The directed subgraph homeomorphism problem (Q1132111) (← links)
- Pathlistings applied to data flow analysis (Q1155957) (← links)
- Translatability of flowcharts into while programs (Q1211348) (← links)
- Analysis of structured programs (Q1212350) (← links)
- Testing flow graph reducibility (Q1221484) (← links)
- Function iteration logics and flowchart schemata (Q1226854) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- Correctness of parallel programs: The Church-Rosser approach (Q1241051) (← links)
- Profitability computations on program flow graphs (Q1242449) (← links)
- A semantically meaningful characterization of reducible flowchart schemes (Q1254851) (← links)
- Algebraic and graph theoretic characterizations of structured flowchart schemes (Q1257333) (← links)
- Solving problems for maximal reducible flowgraphs. (Q1427189) (← links)
- On the resilience of canonical reducible permutation graphs (Q1686046) (← links)
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations (Q1801057) (← links)
- Fast algorithms for the elimination of common subexpressions (Q1846330) (← links)
- A generalized mathematical theory of structured programming (Q2265794) (← links)
- Full characterization of a class of graphs tailored for software watermarking (Q2415367) (← links)
- Flow Hypergraph Reducibility (Q3503561) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
- Applications of graph theory in computer systems (Q4079059) (← links)
- Boolean-valued loops (Q4088262) (← links)
