2010
DOI: 10.1007/978-3-642-11476-2_20
View full text
|
|
Share

Abstract: Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. Two of them are of particular interest: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Considering this fact, we propose here a routing scheme that computes short routes in the class of kchordal graphs, i.e., graphs with no induced cycles of length more than k. In the class of k-chordal g…

Expand abstract