Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ISAAC
2009
Springer

favoriteEmaildiscussreport

95views Algorithms» more ISAAC 2009»

Bandwidth on AT-Free Graphs

13 years 11 months ago

Bandwidth on AT-Free Graphs

Download www.ii.uib.no

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch,

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Bandwidth expansion treewidth separators and universality for boundeddegree graphs

» Flow Graph Balancing for Minimizing the Required Memory Bandwidth

» Some Applications of Graph Bandwidth to Constraint Satisfaction Problems

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» A spectral approach to bandwidth and separator problems in graphs

» On the bandwidth of 3dimensional Hamming graphs

» Spanning 3colourable subgraphs of small bandwidth in dense graphs

» Asymptotic Determination of EdgeBandwidth of Multidimensional Grids and Hamming Graphs

» Approximating Circular Arc Colouring and Bandwidth Allocation in AllOptical Ring Networks

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh

Comments (0)