Sciweavers

139 search results - page 1 / 28
» Bandwidth on AT-Free Graphs
Sort
View
EJC
2010
13 years 5 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
13 years 9 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
AAAI
1990
13 years 6 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
FCT
2003
Springer
13 years 10 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
IPCO
1993
98views Optimization» more  IPCO 1993»
13 years 6 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...