Sciweavers

WG
2001
Springer
14 years 4 months ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...