Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1029019
Jump to:navigation, search

DOI10.1016/J.IPL.2003.08.003zbMath1178.68642OpenAlexW2118197877MaRDI QIDQ1029019

Wim 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

spanning treegraph algorithmsconnected componentthreshold set


Mathematics Subject Classification ID

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


Related Items (1)

On the gold standard for security of universal steganography




Cites Work

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1029019&oldid=13033018"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki