Improved Time Complexity of Bandwidth Approximation in Dense Graphs

Hao-Hsiang Hung

Published in: CoRR (2012)

Keyphrases

approximation error
increase in computational complexity
computational complexity
computational cost
graph matching
bayesian networks
worst case
closed form
network bandwidth
decision problems
directed graph
error bounds
approximation algorithms
graph structure
error tolerance