A tree partition algorithm for analysis of morpholocial structure of material
From MaRDI portal
Publication:2640355
Recommendations
- Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs
- Morphology on Graphs and Minimum Spanning Trees
- Attribute profiles from partitioning trees
- New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones
- Algorithm of extraction and analysis of branching structure
Cites work
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3358495 (Why is no real title available?)
- scientific article; zbMATH DE number 3386718 (Why is no real title available?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
Cited in
(2)
This page was built for publication: A tree partition algorithm for analysis of morpholocial structure of material
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640355)