3 results for “Optimal Minimum Spanning Tree”

Set a search alert

Research ArticleOpen accessIn the keywordsValidation of Global Financial Crisis on Bursa Malaysia Stocks Market Companies via Covariance StructureShamshuritawati Sharif, Suzilah Ismail, Zurni Omar, Low Huey ThengThe global financial crisis of 2007 to 2009 affects the economic development around the world. It started with US in 2007 and followed by Malaysia in 2008. The purpose of this study is to validate the impact before and beginning of the crisis on seventy seven Bursa Malaysia stocks market companies. Two data sets of 2007 and 2008 were used … …American Journal of Applied Sciences, Vol. 13, Issue 11 · 27 Oct 2016 · 7,568 accessesView PDF Cite

Research ArticleOpen accessIn the abstractPolymer Processing and Performance Testing Based on Kruskal Algorithm for Numerical AnalysisYan TangPolymer processing is an injection molding product widely used in communication, medical, and other fields. The processing and forming of polymers involve complex processes, including many parameter controls to ensure the quality of finished products. This study innovatively uses the Kruskal algorithm to conduct numerical analysis on the performance of polymer processing and molding to obtain a scientifically efficient parameter … …American Journal of Biochemistry and Biotechnology, Vol. 20, Issue 3 · 29 Jul 2024 · 4,270 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,813 accessesView PDF Cite