A Fast Heuristic to Pipeline SDF Graphs.
Alexandre HonoratKarol DesnosMickaël DardaillonJean-François NezanPublished in: SAMOS (2020)
Keyphrases
- dynamic programming
- optimal solution
- data sets
- graph search
- graph matching
- bipartite graph
- beam search
- graph mining
- social networks
- greedy heuristic
- simulated annealing
- graphical models
- weighted graph
- graph representation
- maximum independent set
- graph clustering
- graph theoretic
- graph databases
- graph structure
- tabu search
- search algorithm
- decision trees