Title of article :
Salembierʹs Min-tree algorithm turned into breadth first search
Author/Authors :
Wim H. Hesselink، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Keywords :
graph algorithms , Spanning tree , Connected component , Threshold set
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
