Skip to main content
SpringerLink
Log in

An Analysis of the Minimal Spanning Tree Structure

  • Conference paper
Combinatorial Optimization

Part of the book series: NATO ASI Series ((NATO ASI F,volume 82))

  • 322 Accesses

Abstract

In this paper the minimal spanning tree (MST) structure is analyzed by means of the distance random variable and Wroclaw Taxonomy algorithm [2].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Florek, K., L. Lukasiewicz, J. Perkal, and H. Steinhaus. Sur la liaison et la Division des Point d’un Ensemble Fini. Colloq. Math, 2: 282 285, 1951.

    Google Scholar 

  2. Karp, R. M. The probabilistic analysis of some combinatorial search algorithms. In Algorithms and Complexity: New Directions and Recent Results, J. F. Traub(Ed.), 1 19. Academic Press, New York, 1976.

    Google Scholar 

  3. Kruskal, J. B. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. In Proceedings of the American Mathematical Society, 7:48–50, 1956.

    Google Scholar 

  4. Prim, R. C. Shortest Connection Matrix and some generalizations. Bell Systems Technical Journal, 36: 1389–1401, 1957.

    Google Scholar 

  5. Trybus, G. Zastosowania Matematyki, 14: 237–244, 1974.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. California State University, Northridge, CA, 91330, USA

    Elzbieta Trybus

Authors
  1. Elzbieta Trybus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering, Bilkent University, 06533, Ankara, Turkey

    Mustafa Akgül

  2. Fachbereich Mathematik, Universität Kaiserslautern, Erwin-Schroedinger-Straße, W-6750, Kaiserslautern, Germany

    Horst W. Hamacher

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, 32611-2083, Gainesville, FL, USA

    Süleyman Tüfekçi

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trybus, E. (1992). An Analysis of the Minimal Spanning Tree Structure. In: Akgül, M., Hamacher, H.W., Tüfekçi, S. (eds) Combinatorial Optimization. NATO ASI Series, vol 82. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77489-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77489-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-77491-1

  • Online ISBN: 978-3-642-77489-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation