 |
Free and accessible knowledge |
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.
https://hal.archives-ouvertes.fr/hal-01542847
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
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
