Name-independent compact routing in trees (Q2379942): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Latest revision as of 14:23, 2 July 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