Compact Routing for Graphs Excluding a Fixed Minor.

In  DISC '05: in Prodeeding of the 19th International Conference on Distributed Computing

Publisher  Springer

Details

TypeInproceedings
Pages442-456
Volume3724
SeriesLecture Notes in Computer Science
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Compact Routing for Graphs Excluding a Fixed Minor.