Name-independent compact routing in trees (Q2379942): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2007.02.015 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1974678299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Routing with Improved Communication-Space Trade-Off / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compact name-independent routing with minimum stretch / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compact Routing with Name Independence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4733694 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4535803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2007.02.015 / rank | |||
Normal rank |
Latest revision as of 07:31, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Name-independent compact routing in trees |
scientific article |
Statements
Name-independent compact routing in trees (English)
0 references
24 March 2010
0 references
name-independent compact routing
0 references
stretch
0 references
distributed lookup tables
0 references
distributed computing
0 references
combinatorial problems
0 references