Flooding Edge or Node Weighted Graphs

Abstract : This paper defines floodings on edge weighted and on node weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. It is shown that each flooding on a node weighted graph may be interpreted as a flooding on an edge weighted graphs with appropriate weights on the edges. The highest flooding of a graph under a ceiling function is then interpreted as a shortest distance on an augmented graph, using the ultrametric distance function. Thanks to this remark, the classical shortest distance algorithms may be used for constructing floodings.
Type de document :
Communication dans un congrès
Cris L. Luengo Hendriks, Gunilla Borgefors, and Robin Strand. 11th International Symposium, ISMM 2013, May 2013, Uppsala, Sweden. Springer, 7883, pp.341-352, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-38294-9_27>
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00834695
Contributeur : Doriane Ibarra <>
Soumis le : lundi 17 juin 2013 - 10:33:12
Dernière modification le : mardi 12 septembre 2017 - 11:40:53

Identifiants

Collections

Citation

Fernand Meyer. Flooding Edge or Node Weighted Graphs. Cris L. Luengo Hendriks, Gunilla Borgefors, and Robin Strand. 11th International Symposium, ISMM 2013, May 2013, Uppsala, Sweden. Springer, 7883, pp.341-352, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-38294-9_27>. <hal-00834695>

Partager

Métriques

Consultations de la notice

65