SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .

SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .

<p>Abstract:<align=\"justify\"> <br /> <br /> <br /> <br /> There are several known methods for finding a minimum spanning tree from connected weighted graph. Using Kruskal\'s algorithm and independent components of edges equivalent classes,...

Full description

Saved in:
Bibliographic Details
Main Author: Narwen
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/5301
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:5301
spelling id-itb.:53012006-02-22T11:35:41ZSUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF . Narwen Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/5301 <p>Abstract:<align=\"justify\"> <br /> <br /> <br /> <br /> There are several known methods for finding a minimum spanning tree from connected weighted graph. Using Kruskal\'s algorithm and independent components of edges equivalent classes, and also determinant of nonsingular sub matrix of incidence matrix of graph, we will be present a method for the determination of all minimum spanning tree from a given connected weighted graph. These method can also be used for the case where we have minimum spanning tree with constraint.<align=\"justify\"> <br /> text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description <p>Abstract:<align=\"justify\"> <br /> <br /> <br /> <br /> There are several known methods for finding a minimum spanning tree from connected weighted graph. Using Kruskal\'s algorithm and independent components of edges equivalent classes, and also determinant of nonsingular sub matrix of incidence matrix of graph, we will be present a method for the determination of all minimum spanning tree from a given connected weighted graph. These method can also be used for the case where we have minimum spanning tree with constraint.<align=\"justify\"> <br />
format Theses
author Narwen
spellingShingle Narwen
SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
author_facet Narwen
author_sort Narwen
title SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
title_short SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
title_full SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
title_fullStr SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
title_full_unstemmed SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
title_sort suatu metoda untuk menentukan semua minimum spanning tree dalam suatu graf graf .
url https://digilib.itb.ac.id/gdl/view/5301
_version_ 1820663647247007744

Similar Items