Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5523196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant memory routing in quasi-planar and quasi-polyhedral graphs |
scientific article; zbMATH DE number 5523196 |
Statements
Constant memory routing in quasi-planar and quasi-polyhedral graphs (English)
0 references
4 March 2009
0 references
ad hoc network
0 references
routing
0 references
planar graph
0 references
local algorithm
0 references
0 references
0 references
0.8080192804336548
0 references
0.7960554957389832
0 references
0.7946850061416626
0 references
0.7846795320510864
0 references
