Sciweavers

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

106

Voted

WDAG
2005
Springer

98views Algorithms» more WDAG 2005»

Compact Routing for Graphs Excluding a Fixed Minor

15 years 8 months ago

Compact Routing for Graphs Excluding a Fixed Minor

Download dept-info.labri.fr

Ittai Abraham, Cyril Gavoille, Dahlia Malkhi

Real-time Traffic

Algorithms | WDAG 2005 |

claim paper

Related Content

» FixedPoint Definability and Polynomial Time on Graphs with Excluded Minors

» Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

» A Separator Theorem for Graphs with an Excluded Minor and its Applications

» FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs

» On the geometry of graphs with a forbidden minor

» Bidimensionality and Kernels

» Counting Subgraphs via Homomorphisms

» Some Results on Greedy Embeddings in Metric Spaces

» On Interval Routing Schemes and Treewidth

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WDAG
Authors	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi

Comments (0)