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.
Type de document :
Communication dans un congrès
International Workshop on Graph-Based Representations in Pattern Recognition, 2013, Vienna, Austria. 7877, pp.31-40, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38221-5_4〉
https://hal.archives-ouvertes.fr/hal-01542847
Contributeur : François Willot
<>
Soumis le : mardi 20 juin 2017 - 11:01:56
Dernière modification le : mardi 27 mars 2018 - 16:06:13
