Salembier's min-tree algorithm turned into breadth first search

DOI10.1016/J.IPL.2003.08.003MaRDI QIDQ1029019zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 9 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2003.08.003

zbMATH Keywords

connected componentgraph algorithmsspanning treethreshold set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Cites work

• Concurrent determination of connected components
• Efficiency of a Good But Not Linear Set Union Algorithm

Cited in

(1)

• On the gold standard for security of universal steganography

This page was built for publication: Salembier's min-tree algorithm turned into breadth first search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029019)