Algorithm 42. Enclosure of a point to the minimum spanning tree
G. Trybuś (1976)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube”
Algorithm 42. Enclosure of a point to the minimum spanning tree
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
A Note on Spanning Trees for Network Location Problems
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Minimum eccentricity multicast trees.
Krumme, David, Fragopoulou, Paraskevi (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The color-balanced spanning tree problem
Štefan Berežný, Vladimír Lacko (2005)
Kybernetika
Similarity:
Suppose a graph whose edges are partitioned into disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number of categories and present some polynomial algorithm.
Spanning trees with leaves bounded by independence number.
Sun, Ling-li (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity:
On some polynomial solvable cases of the generalized minimum spanning tree problem.
Pop, Petrică Claudiu (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
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.