HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Flooding Edge Weighted Graphs

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : François Willot Connect in order to contact the contributor
Submitted on : Tuesday, June 20, 2017 - 11:01:56 AM
Last modification on : Wednesday, November 17, 2021 - 12:27:14 PM

Links full text



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⟩



Record views