Login / Signup
Reducing the Complexity of Dataflow Graphs Using Slack-Based Merging.
Hazem Ismail Ali
Sander Stuijk
Benny Akesson
Luís Miguel Pinho
Published in:
ACM Trans. Design Autom. Electr. Syst. (2017)
Keyphrases
</>
graph transformation
loss function
graph matching
space complexity
pattern recognition
representational power
graph representation
graph model
memory requirements
database
weighted graph
graph structure
parallel computing
graph theory
graph theoretic
graph structures
polynomial time complexity