Approximating Bandwidth by Mixing Layouts of Interval Graphs.

Dieter Kratsch Lorna Stewart

Published in: SIAM J. Discret. Math. (2002)

Keyphrases

graph matching
graph theoretic
graph theory
graph partitioning
storage capacity
end to end
directed graph
graph structure
high bandwidth
graph representation
complex structures
graph model
graph mining
neural network
bayesian networks
clustering algorithm
social networks