In this paper we introduce a new model for compact routing called the Compact-Port model. It is based on routing tables that have a different structure with respect to the previous schemes, and it gives a new way of succinctly representing the shortest-path information in interconnection networks. A
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
โ Scribed by Shin-ichi Nakano; Ryuhei Uehara; Takeaki Uno
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 601 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1000-9000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider a parallel tree contraction scheme which in each contraction phase ลฝ . ลฝ . removes leaves and nodes in the maximal chains. Let T n and P n denote the time and processor complexity required to compute the all nearest smaller values ลฝ . ANSV and the minimum of n values for input elements d
Wilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom. Inspired by their work, a class of incidence structures associated with distance-regular graphs with classical parameters is studied in this paper. As a