NDLI: Computing minimum spanning trees efficiently

Please wait, while we are loading the content...

Integrating small computers within a conversational time-sharing environment

Interactive languages in health computer sciences at the University of Minnesota

Recent improvements in Braille transcription

Network computer modeling

The MIX computer as an educational tool

Large scale CAI: the NSF project

Recursive functional programming as a conceptual tool for social scientists

A simple hardware model of a Turing machine: its educational use

An algebraic approach to test data generation

Modular requirements for digital logic simulation at a predefined functional level

A system for computer generated movies

Applications of relational data structure models in man-machine systems

Reduction of integer programs to accelerate a multiple choice programming algorithm

Background reading in microprogramming and emulation

Mirager, the "best-yet" approach for horizontal microprogramming

A Personal Computer for Children of All Ages

Writing an interactive psychiatric information system

An integrated command and procedural language for drug research

Digital processing of the speech of deaf children

Performance analysis of error-detecting-and-correcting codes in a random-error environment

Assist: a self modifiable assembler for instructional purposes

The use of logo in a "computers and society" course

Computer-aided schema for instructional gaming

Design of diagnosible automata

An interactive system for computer-aided design of printed circuit boards

Graphic systems performance evaluation

The leadermart system and service

Variable metric and conjugate direction methods in unconstrained optimization: recent developments

MPGS: a high-level language for microprogram generating system

Design features of a real-time electrocardiographic monitoring system

A choice of language to support medical research

System study of a dial-up text reading service for the blind

Strategies for operating systems in computer networks

On making a theorem for a child

Fault detection test derivation using Boolean difference techniques

Autocheck program, program to check validity of printed circuit cards and circuit usage

A solution to the hidden surface problem

Design considerations for a Boolean search system with automatic relevance feedback processing

Large scale optimization and the relaxation method

Microprogramming for probability distribution sampling

Current research in computer science (Research Session)

Teaching speech to the deaf: can a computer help

An experimental application of cryptography to a remotely accessed data system

Computer generated animation of faces

An image matrix for accessing files

On shortest paths and sorting

Systemware: a technique for digital emulation and interfacing

Virtual memories for mini-computers

Computing minimum spanning trees efficiently

A Logic-in-Memory architecture for large-scale-integration technologies

A decomposition algorithm for integer programming problems with many columns

Limitations in pattern recognition and problem solving

Optimum concentrator location in telecommunications design

The current state of proving programs correct

Robots, productivity and quality

Reproductive adaptive plans

N-sorted logic for automatic theorem-proving in higher-order logic

A complete mechanization of (Ω) -order type theory

Dynamic programming as applied to feature subset selection in a pattern recognition system

A ROM random-pulse computer for classifying binary patterns

Control systems in robots

A syntax directed approach for handling natural language relations

Continuing education in information system development

Curriculum recommendations for a master's program in information systems development

The undergraduate program in information systems development

Perception of computer simulated pulmonary lesions in chest radiographs

A method for identifying irregular antibodies in a sample of serum

Small computer-based system for the analysis of respiration response to atmosphere pollution

The undergraduate education of medical computer scientists

Large scale computers in medical schools

Computing minimum spanning trees efficiently

Content Provider	ACM Digital Library
Author	Kershenbaum, A. Van Slyke, R.
Abstract	A ubiquitous problem in mathematical programming is the calculation of minimum spanning trees. Minimum spanning tree algorithms find application in such diverse areas as: least cost electrical wiring, minimum cost connecting communication and transportation networks, network reliability problems, minimum stress networks, clustering and numerical taxonomy, algorithms for solving traveling salesman problems, and multiterminal network flows. It is therefore important to know how to carry out these computations as efficiently as possible.The problem is to find a spanning subtree of a given connected network which has minimum total length. Kruskal in 1956 showed that a "greedy" algorithm could be used; that is, if one looks at arcs in order of increasing length the first tree that can be formed is a minimum spanning tree. Shortly thereafter Prim and Dijkstra suggested another algorithm which appeared to be more efficient. Recent work suggests that a suitable implementation of Kruskal's Algorithm is computationally more efficient in a number of interesting cases, in particular when the network under consideration is sparse.A modification of Kruskal's Algorithm for the solution to the MST problem is presented and is compared with Prim's Algorithm. Prim's Algorithm is shown to have an upper bound on the number of calculations on the order of $NN^{2},$ when applied to a network with NN nodes, regardless of the number of arcs in the network. The modification of Kruskal's Algorithm is shown to have an upper bound on the order of NA log2 NA calculations, where NA is the number of arcs in the network. Thus for sparse networks a dramatic reduction in execution time can be obtained by the use of Kruskal's Algorithm. The effect is enhanced by the fact that Prim's Algorithm achieves its upper bound while the Kruskal modification, in general, does not. Modifications to both Prim's and Kruskal's Algorithms are introduced which give significant improvements for the complete range of sparseness.The relative merit of each algorithm is a function of sparseness of the network, the form in which the problem data is represented, the tradeoff between computation speed and storage requirements, the amount of time one wants to spend in coding, as well as many other factors. The interaction of these factors in choosing the appropriate algorithms for important classes of applications will be discussed in detail.
Starting Page	518
Ending Page	527
Page Count	10
File Format	PDF
DOI	10.1145/800193.569966
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1972-08-01
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Connectivity Minimum spanning trees Sorting
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in