On compact and efficient routing in certain graph classes (Q997073)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On compact and efficient routing in certain graph classes |
scientific article; zbMATH DE number 5173161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On compact and efficient routing in certain graph classes |
scientific article; zbMATH DE number 5173161 |
Statements
On compact and efficient routing in certain graph classes (English)
0 references
19 July 2007
0 references
message routing
0 references
localized distributed algorithms
0 references
tree-decomposition
0 references
acyclic clustering
0 references
chordal bipartite graphs
0 references
homogeneously orderable graphs
0 references
0 references
0.99533611536026
0 references
0.8347416520118713
0 references
0.7763426899909973
0 references
