ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES (Q3606546)
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 ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES |
scientific article; zbMATH DE number 5519640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES |
scientific article; zbMATH DE number 5519640 |
Statements
ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES (English)
0 references
26 February 2009
0 references
routing
0 references
fault information model
0 references
0.7906109094619751
0 references
0.7791865468025208
0 references
0.7545165419578552
0 references
0.7537325024604797
0 references
