ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Agronomy and forestry
Biology
Technology
Environment
Education
Computing
Mathematics
Computing
Research
Social Sciences
all records (74)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
South Africa
Ukraine
Spain
Romania
Australia
India
Turkey, Turkish Republic
all records (76)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
19.965  Articles
1 of 1.997 pages  |  10  records  |  more records»
Salah satu hal penting dalam pendistribusian adalah jalur dan jarak yang optimal agar distribusi yang dilakukan lebih efektif dan efisien. Pada penelitian ini, metode spanning tree algoritma Kruskal dan algoritma Prim diimplementasikan untuk membantu dala... see more

Purpose: The aim of this paper is to describe another possibility of portfolio creation using the minimum spanning tree method. The research contributes to the existing body of knowledge with using and subsequently developing a new approach based on graph... see more

Universitas Islam Indonesia (UII) intergrated campus computer network built since 1995. Development of UII integrated campus computer network is using a star topology and fiber optic (FO) cable. Considering that the star topology is the topology that requ... see more

Algoritma Prim adalah algoritma yang dapat digunakan untuk mencari pohon rentang minimal (minimum spanning tree) untuk graf berbobot. Permasalahan dalam penulisan skripsi ini adalah bagaimana hasil pohon rentang minimal jaringan kabel listrik dengan mengg... see more

We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.  This leads to a characterization of chordal graphs via deletio... see more

We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set S of n point-sites in the plane. More precisely, we assume that S resides in a random-access memory that can only be read. The edges of the Euclidean minimum ... see more

Tujuan dari penelitian ini adalah untuk menganalisis perbandingan akurasi   dalam  penyelesaian masalah minimum spanning tree dengan menggunakan algoritma PSO dan FA.  Sehingga mendapatkan akurasi terbaik dari keduaalgoritma tersebut. ... see more

This paper proposes a new approach to study the sensitivity analysis in the network ow problems, in particular, the minimum spanning tree and shortest path problems. In a sensitivity analysis, one looks for the amount of changes in the edges' weights, num... see more

Abstract. Optimization is important in an algorithm. It can save the operational costs of an activity. In the Minimum Spanning Tree, the goal is to achieve how all vertices are connected with the smallest weights. Several algorithms can calculate the use ... see more

1 of 1.997 pages  |  10  records  |  more records»