An O(N log N) minimal spanning tree algorithm for N points in the planeCHANG, R. C; LEE, R. C. T.BIT (Nordisk Tidskrift for Informationsbehandling). 1986, Vol 26, Num 1, pp 7-16, issn 0006-3835Article

The relative neighborhood graph, with an application to minimum spanning treesSUPOWIT, K. J.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 428-448, issn 0004-5411Article

k-Sum optimization problemsGUPTA, S. K; PUNNEN, A. P.Operations research letters. 1990, Vol 9, Num 2, pp 121-126, issn 0167-6377, 6 p.Article

An 0(log n) algorithm for parallel update of minimum spanning treesSHAUNAK PAWAGI; RAMAKRISHNAN, I. V.Information processing letters. 1986, Vol 22, Num 5, pp 223-229, issn 0020-0190Article

The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be OpenINNAMI, N; KIM, B. H; MASHIKO, Y et al.Algorithmica. 2010, Vol 57, Num 4, pp 869-872, issn 0178-4617, 4 p.Article

Cost of sequential connection for points in spaceSTEELE, J. M.Operations research letters. 1989, Vol 8, Num 3, pp 137-142, issn 0167-6377, 6 p.Article

Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning treeHONG SHEN.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 129-136, issn 0020-7160Article

The Spanning Diameter of the Star GraphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. F et al.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 551-556, isbn 0-7695-2135-5, 1Vol, 6 p.Conference Paper

Nearly linear time approximation schemes for Euclidean TSP and other geometric problemsARORA, S.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63248-4, p. 55Conference Paper

A simple proof of the Steiner ratio conjecture for five pointsFRIEDEL, J; WIDMAYER, P.SIAM journal on applied mathematics (Print). 1989, Vol 49, Num 3, pp 960-967, issn 0036-1399Article

Testing for uniformity in multidimensional dataSMITH, S. P; JAIN, A. K.IEEE transactions on pattern analysis and machine intelligence. 1984, Vol 6, Num 1, pp 73-81, issn 0162-8828Article

Low-degree spanning trees of small weightKHULLER, S; BALAJI RAGHAVACHARI; YOUNG, N et al.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 355-368, issn 0097-5397Article

An algorithm for finding a matroid basis which maximizes the product of the weights of the elementsFENNER, T. I; FRIEZE, A. M.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 3, pp 434-438, issn 0006-3835Article

Estimating the length of minimal spanning trees in compression of filesERNVALL, J; NEVALAINEN, O.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 19-32, issn 0006-3835Article

The path matrix of a graph, its construction and its use in evaluating certain productsROBERSON, R. E.Computer methods in applied mechanics and engineering. 1984, Vol 42, Num 1, pp 47-56, issn 0045-7825Article

Counting shanning trees in the graphs of Kleitman and Golden and a generalizationVOHRA, R; WASHINGTON, L.Journal of the Franklin Institute. 1984, Vol 318, Num 5, pp 349-355, issn 0016-0032Article

Polynomial testing of the query «is a^b>c^d?» with application to finding a minimal cost reliability ratio spanning treeCHANDRASEKARAN, R; TAMIR, A.Discrete applied mathematics. 1984, Vol 9, Num 2, pp 117-123, issn 0166-218XArticle

Computationally efficient image mosaicing using spanning tree representationsNIKOLAIDIS, Nikos; PITAS, Ioannis.Lecture notes in computer science. 2005, pp 716-724, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 9 p.Conference Paper

Spanning trees with many leaves in cubic graphsGRIGGS, J. R; KLEITMAN, D. J; SHASTRI, A et al.Journal of graph theory. 1989, Vol 13, Num 6, pp 669-695, issn 0364-9024, 27 p.Article

Interpolation theorem for diameters of spanning treesHARARY, F; MOKKEN, R. J; PLANTHOLT, M. J et al.IEEE transactions on circuits and systems. 1983, Vol 30, Num 7, pp 429-432, issn 0098-4094Article

On the asymptotic growth rate of some spanning trees embedded in ℝ^dDE CASTRO, Pedro M. M; DEVILLERS, Olivier.Operations research letters. 2011, Vol 39, Num 1, pp 44-48, issn 0167-6377, 5 p.Article

An Efficient Routing Mechanism in Network SimulationZHIYU HAO; XIAOCHUN YUN; HONGLI ZHANG et al.Simulation (San Diego, Calif.). 2008, Vol 84, Num 10-11, pp 511-520, issn 0037-5497, 10 p.Article

Graphs with not too many spanning treesGUOLI DING.Networks (New York, NY). 1995, Vol 25, Num 4, pp 193-197, issn 0028-3045Article

On the number of spanning trees of circulant graphsWANG, J. F; YANG, C. S.International journal of computer mathematics. 1984, Vol 16, Num 3-4, pp 229-241, issn 0020-7160Article

Page / 59