Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
11
references
Top references
cited by
18
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,325
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Routing in Trees
other
Author(s):
Pierre Fraigniaud
,
Cyril Gavoille
Publication date
(Online):
July 4 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
11
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Compact routing schemes
Mikkel Thorup
,
Uri Zwick
(2001)
0
comments
Cited
34
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Tables
J. Munro
(1996)
0
comments
Cited
30
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A trade-off between space and efficiency for routing tables
Eli Upfal
,
David Peleg
(1989)
0
comments
Cited
25
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
July 4 2001
Pages
: 757-772
DOI:
10.1007/3-540-48224-5_62
SO-VID:
656a212e-6be1-46cd-b6b6-971dc3a5fb4c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 24
Languages, Rewriting Systems, and Verification of Infinite-State Systems
pp. 201
Approximation Hardness of TSP with Bounded Metrics
pp. 64
Theoretical Aspects of Evolutionary Algorithms
pp. 249
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
pp. 261
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
pp. 273
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
pp. 370
Axiomatizations for Probabilistic Bisimulation
pp. 382
Noninterference for Concurrent Programs
pp. 396
Distributed Controller Synthesis for Local Specifications
pp. 421
Towards Quantitative Verification of Probabilistic Transition Systems
pp. 469
A New Method for Balancing Binary Search Trees
pp. 652
Model Checking of Unrestricted Hierarchical State Machines
pp. 667
Symbolic Trace Analysis of Cryptographic Protocols
pp. 694
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
pp. 708
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
pp. 757
Routing in Trees
pp. 797
Realizability and Verification of MSC Graphs
pp. 848
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
pp. 862
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
pp. 912
Information-Theoretic Private Information Retrieval: A Unified Construction
pp. 927
Secure Multiparty Computation of Approximations
pp. 1017
Time and Space Bounds for Reversible Simulation
Similar content
1,325
Timber trees and forests of North Carolina (No. 6)
Authors:
G Pinchot
Changes in biosynthesis of aroma volatile compounds during on-tree maturation of ‘Pink Lady®’ apples
Authors:
C. Villatoro
,
R. Altisent
,
G Echeverria
…
Detecting and mapping tree crowns based on convolutional neural network and Google Earth images
Authors:
Mingxia Yang
,
Yuling Mou
,
Shan Liu
…
See all similar
Cited by
18
How to meet when you forget: log-space rendezvous in arbitrary graphs
Authors:
Jurek Czyzowicz
,
Adrian Kosowski
,
Andrzej Pelc
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
Authors:
Feodor Dragan
,
Michel Habib
,
Yann Vaxès
…
Compact Routing in Power-Law Graphs
Authors:
Wei Chen
,
Christian Sommer
,
Shang-Hua Teng
…
See all cited by