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

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

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

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

Three algorithms for a minimum cost file transfer problemKANEKO, Yoshihiro.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol II, 493-496Conference Paper

A faster FPT algorithm for finding spanning trees with many leavesBONSMA, Paul S; BRUEGGEMANN, Tobias; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2003, pp 259-268, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Extreme distances in multicolored point setsDUMITRESCU, Adrian; GUHA, Sumanta.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 14-25Conference Paper

Approximating clique and biclique problemsHOCHBAUM, D. S.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 174-200, issn 0196-6774Article

Degree-constrained network spanners with nonconstant delayLIESTMAN, A. L; SHERMER, T. C.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 2, pp 291-321, issn 0895-4801Article

On identifying tree-structured perfect mapsBORGELT, Christian.Lecture notes in computer science. 2003, pp 385-395, issn 0302-9743, isbn 3-540-20059-2, 11 p.Conference Paper

Generalized bicyclesBERMAN, K. A; LIU, Y.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 27-40, issn 0166-218XArticle

The backbone of a citySCELLATO, S; CARDILLO, A; LATORA, V et al.The European physical journal. B, Condensed matter physics. 2006, Vol 50, Num 1-2, pp 221-225, issn 1434-6028, 5 p.Conference Paper

Cellular automata in the hyperbolic plane: Proposal for a new environmentCHELGHOUM, Kamel; MARGENSTEM, Maurice; MARTIN, Benoit et al.Lecture notes in computer science. 2004, pp 678-687, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Minimum cost K-forest coversBAAS, S. M; ORESTES CERDEIRA, J.Mathematical methods of operations research (Heidelberg). 1996, Vol 44, Num 2, pp 255-265, issn 1432-2994Article

Sur la réunion des arbres maximaux d'un graphe totalement préordonné. Note auto-critique = On the union of the maximal spanning trees of a completely preordered graph. A self-critical noteFLAMENT, C.Mathématiques, informatique et sciences humaines. 1993, Num 121, pp 35-40, issn 0995-2314Article

Infinite connected graphs with no end-preserving spanning treesTHOMASSEN, C.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 322-324, issn 0095-8956Article

Counting minimum weight spanning treesBRODER, A. Z; MAYR, E. W.Journal of algorithms (Print). 1997, Vol 24, Num 1, pp 171-176, issn 0196-6774Article

On the impact of sense of direction on message complexityFLOCCHINI, P; MANS, B; SANTORO, N et al.Information processing letters. 1997, Vol 63, Num 1, pp 23-31, issn 0020-0190Article

A priori bounds of the euclidean traveling salesmanSNYDER, T. L; STEELE, J. M.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 665-671, issn 0097-5397Article

Page / 48