Title of article

Salembierʹs Min-tree algorithm turned into breadth first search

Author/Authors

Wim H. Hesselink، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 2003

Pages

5

From page

225

To page

229

Keywords

graph algorithms , Spanning tree , Connected component , Threshold set

Journal title

Information Processing Letters

Serial Year

2003

Journal title

Information Processing Letters

Record number

129814