Flooding Edge or Node Weighted Graphs - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Flooding Edge or Node Weighted Graphs

Fernand Meyer


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.

Dates et versions

hal-00834695 , version 1 (17-06-2013)



Fernand Meyer. Flooding Edge or Node Weighted Graphs. 11th International Symposium, ISMM 2013, May 2013, Uppsala, Sweden. pp.341-352, ⟨10.1007/978-3-642-38294-9_29⟩. ⟨hal-00834695⟩
191 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More