The color-balanced spanning tree problem

Štefan Berežný; Vladimír Lacko

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “The color-balanced spanning tree problem”

A Bicriterion Steiner Tree Problem on Graph

Mirko Vujošević, Milan Stanojević (2003)

The Yugoslav Journal of Operations Research

Similarity:

Variations for spanning trees.

Zsakó, László (2006)

Annales Mathematicae et Informaticae

Similarity:

A few remarks on the history of MST-problem

Jaroslav Nešetřil (1997)

Archivum Mathematicum

Similarity:

On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.