The following pages link to Testing flow graph reducibility (Q1221484):
Displaying 16 items.
- Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Flow hypergraph reducibility (Q643016) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Notes on oriented depth-first search and longest paths (Q1118610) (← links)
- Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- On the resilience of canonical reducible permutation graphs (Q1686046) (← links)
- A generalized mathematical theory of structured programming (Q2265794) (← links)
- Full characterization of a class of graphs tailored for software watermarking (Q2415367) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Modelling and programming stream-based distributed computing based on the meta-pipeline approach (Q3399237) (← links)
- Program derivation with verified transformations — a case study (Q4884666) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
