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

A new evolutionary algorithm for spanning-tree based communication network designSOAK, Sang-Moon; CORNE, David; AHN, Byung-Ha et al.IEICE transactions on communications. 2005, Vol 88, Num 10, pp 4090-4093, issn 0916-8516, 4 p.Article

A tutte polynomial for signed graphsKAUFFMAN, L. H.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 105-127, issn 0166-218X, 23 p.Article

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

The Number of Spanning Trees in a Class of Double Fixed-Step Loop NetworksXUERONG YONG; YUANPING ZHANG; GOLIN, Mordecai J et al.Networks (New York, NY). 2008, Vol 52, Num 2, pp 69-77, issn 0028-3045, 9 p.Article

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

A generalization of obligation rules for minimum cost spanning tree problemsBERGANTINOS, Gustavo; LORENZO, Leticia; LORENZO-FREIRE, Silvia et al.European journal of operational research. 2011, Vol 211, Num 1, pp 122-129, issn 0377-2217, 8 p.Article

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

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

Undirected simple connected graphs with minimum number of spanning treesBOGDANOWICZ, Zbigniew R.Discrete mathematics. 2009, Vol 309, Num 10, pp 3074-3082, issn 0012-365X, 9 p.Article

Neighborhood unions and extremal spanning treesFLANDRIN, Evelyne; KAISER, Tomas; KUZEL, Roman et al.Discrete mathematics. 2008, Vol 308, Num 12, pp 2343-2350, issn 0012-365X, 8 p.Article

Spanning trees with at most k leaves in K_1,4-free graphsKYAW, Aung.Discrete mathematics. 2011, Vol 311, Num 20, pp 2135-2142, issn 0012-365X, 8 p.Article

A branch and bound algorithm for the robust spanning tree problem with interval dataMONTEMANNI, R; GAMBARDELLA, L. M.European journal of operational research. 2005, Vol 161, Num 3, pp 771-779, issn 0377-2217, 9 p.Article

Low-degree minimal spanning trees in normed spacesMARTINI, Horst; SWANEPOEL, Konrad J.Applied mathematics letters. 2006, Vol 19, Num 2, pp 122-125, issn 0893-9659, 4 p.Article

A mixed integer linear formulation for the minimum label spanning tree problemEUGENIA CAPTIVO, M; CLIMACO, Joao C. N; PASCOAL, Marta M. B et al.Computers & operations research. 2009, Vol 36, Num 11, pp 3082-3085, issn 0305-0548, 4 p.Article

Spanning trees with at most 3 leaves in K_1,4-free graphsKYAW, Aung.Discrete mathematics. 2009, Vol 309, Num 20, pp 6146-6148, issn 0012-365X, 3 p.Article

An exact algorithm for the Maximum Leaf Spanning Tree problemFERNAU, Henning; KNEIS, Joachim; KRATSCH, Dieter et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6290-6302, issn 0304-3975, 13 p.Article

The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processorsKORACH, E; MORAN, S; ZAKS, S et al.SIAM journal on computing (Print). 1987, Vol 16, Num 2, pp 231-236, issn 0097-5397Article

Heavy cycles and spanning trees with few leaves in weighted graphsBINLONG LI; SHENGGUI ZHANG.Applied mathematics letters. 2011, Vol 24, Num 6, pp 908-910, issn 0893-9659, 3 p.Article

A genetic algorithm approach on tree-like telecommunication network design problemZHOU, G; GEN, M.The Journal of the Operational Research Society. 2003, Vol 54, Num 3, pp 248-254, issn 0160-5682, 7 p.Article

A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc GraphsLIN, Ching-Chi; CHEN, Gen-Huey; CHANG, Gerard J et al.Algorithmica. 2013, Vol 66, Num 2, pp 369-396, issn 0178-4617, 28 p.Article

On the bicriterion - minimal cost/minimal label - spanning tree problemCLIMACO, João C. N; EUGENIA CAPTIVO, M; PASCOAL, Marta M. B et al.European journal of operational research. 2010, Vol 204, Num 2, pp 199-205, issn 0377-2217, 7 p.Article

Infinite volume limit of the Abelian sandpile model in dimensions d ≥ 3JARAI, Antal A; REDIG, Frank.Probability theory and related fields. 2008, Vol 141, Num 1-2, pp 181-212, issn 0178-8051, 32 p.Article

A 2 + ε approximation algorithm for the k-MST problemARORA, Sanjeev; KARAKOSTAS, George.Mathematical programming. 2006, Vol 107, Num 3, pp 491-504, issn 0025-5610, 14 p.Article

Savings based ant colony optimization for the capacitated minimum spanning tree problemREIMANN, Marc; LAUMANNS, Marco.Computers & operations research. 2006, Vol 33, Num 6, pp 1794-1822, issn 0305-0548, 29 p.Article