Improving Efficiency of Program Graph Scheduling with Partial Strict Triggering of Program Graph Nodes.
Milan OjstersekAleksander KvasPublished in: Informatica (Slovenia) (2003)
Keyphrases
- graph structure
- directed graph
- weighted graph
- undirected graph
- random walk
- graph theory
- nodes of a graph
- graph theoretic
- graph model
- spanning tree
- graph representation
- graph structures
- adjacency matrix
- directed acyclic graph
- bipartite graph
- graph matching
- computer programs
- structured data
- root node
- fully connected
- series parallel
- strongly connected
- optimal solution