Refinement of worst-case execution time bounds by graph pruning.
Florian BrandnerAlexander JordanPublished in: Comput. Lang. Syst. Struct. (2014)
Keyphrases
- lower bound
- upper bound
- search space
- structured data
- graph theory
- average case
- graph representation
- graph structure
- stable set
- pruning method
- graph structures
- bipartite graph
- graph model
- spanning tree
- graph based algorithm
- graph partitioning
- link analysis
- weighted graph
- graph matching
- lower and upper bounds
- upper and lower bounds
- graph data
- pruning algorithm
- dependency graph
- directed graph
- random walk
- worst case
- tree pruning