Reducing the Storage Requirements of Constraint Dataflow Graphs.
Brad T. Vander ZandenRichard L. HaltermanPublished in: ACM Symposium on User Interface Software and Technology (1999)
Keyphrases
- storage requirements
- significantly reduced
- graph transformation
- computational cost
- high computational complexity
- compression rate
- graph representation
- computational complexity
- directed graph
- graph matching
- data flow
- bipartite graph
- memory requirements
- linear constraints
- constraint networks
- parallel computing
- weighted graph
- control flow
- graph theory
- database machine