ALGORITHM AND IMPLEMENTATION OF DRAWING K-CONNECTED GRAPH WITH SMALL DIAMETER

NEGHE, MEIDY SILVIA and Pinontoan, Benny and Padang, Rubby A. (2004) ALGORITHM AND IMPLEMENTATION OF DRAWING K-CONNECTED GRAPH WITH SMALL DIAMETER. Skripsi thesis, UNIVERSITAS KATOLIK DE LA SALLE.

	PDF COVER-DAFTAR_ISI_MeidyNeghe.pdf Download (333kB)
	PDF BAB_ISI-LAMPIRAN_MeidyNeghe.pdf Restricted to Repository staff only Download (805kB)

Official URL: http://digilib.unikadelasalle.ac.id/

Abstract

Computer network becomes important nowadays. The rapid changes of technology make the consequences for the computer networking to improve the quality itself. In communication between the computers there are many things that must be considered to, such as the number of the connection that connected to one station, and how far the data will be transferred.
In designing the network model there are some weakness that usually done by the designer, in case of the connectivity. In some topologies that already exist there are no specific attentions in the sense of connectivity and the minimum distance that can be treasure in the network.
To discuss more about how to model the network with the specific connection, it will be shown in a graph model. In the real world case, there are a lot of things that can be represented as a graph, and one of it is the network. Each station in the network will be represent as a dot (vertex) and the connection will be represent with a line (edge).
In this thesis, we give an algorithm that used to design a network connection between computers, with a specific connection and also the maximum of the minimum distance that possible in the network. To explore this algorithm, there are some theorems used in case to help in specifying the model of the network. We also give an implementation of the algorithm, as the testing model of the algorithm itself.

Keywords: algorithm, drawing network, graph theory, k-connected graph, diameter.

Item Type:

Thesis (Skripsi)

Creators: