Flooding Edge Weighted Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Flooding Edge Weighted Graphs

Fernand Meyer


This paper characterizes floodings on edge weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. Two classes of algorithms for their construction are presented. The first are applied on the dendrogram representing the hierarchy associated to the edge weighted graph. The second consist in shortest distance algorithms on the graph itself.

Dates and versions

hal-01542847 , version 1 (20-06-2017)



Fernand Meyer. Flooding Edge Weighted Graphs. International Workshop on Graph-Based Representations in Pattern Recognition, 2013, Vienna, Austria. pp.31-40, ⟨10.1007/978-3-642-38221-5_4⟩. ⟨hal-01542847⟩
4690 View
0 Download



Gmail Facebook Twitter LinkedIn More