Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of ...

ABSTRACT: Stock returns exhibit nonlinear dynamics and volatility clustering. It is well known that we cannot forecast the movements of stock prices under the condition that market is efficient. In ...

Abstract: Quantum computing algorithms are considered for several problems in graph theory. Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a ...

Julia and Python complex system applications in ecology, epidemiology, sociology, economics & finance; network science models including Bianconi-Barabási, Barabási-Albert, Watts-Strogatz, Waxman Model ...

This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton ...

In 1983, Gallager, Humblet, and Spira published a distributed algorithm for computing a minimum spanning tree. For several years, I regarded it as a benchmark problem for verifying concurrent ...

Abstract: We can only get a minimum spanning tree from all the spanning trees with the current minimum spanning tree algorithm, So we hope to present a new algorithm to improve it. The new algorithm ...

Ask the publishers to restore access to 500,000+ books. An icon used to represent a menu that can be toggled by interacting with this icon. A line drawing of the Internet Archive headquarters building ...

Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...