Minimum Spanning Forests for Morphological Segmentation

Publisher Website

1 January 1994

book chapter
Published by Springer Nature

p. 77-84
https://doi.org/10.1007/978-94-011-1040-2_11

Abstract

No abstract available

Keywords

This publication has 5 references indexed in Scilit:

Graphs and mathematical morphology
Signal Processing, 1989
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
Information Processing Letters, 1975
Letter to the Editor—The Maximum Capacity Route Problem
Operations Research, 1961
Shortest Connection Networks And Some Generalizations
Bell System Technical Journal, 1957
On the shortest spanning subtree of a graph and the traveling salesman problem
Proceedings of the American Mathematical Society, 1956