ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH

The study of cycles in a graph is one of interesting topics in graph theory. Such studies include the study of determining whether a graph having a Hamiltonian cycle or not; and the study of finding a smallest cycle in a given graph. Detecting cycles in graphs has also important applications in some...

Full description

Saved in:

Bibliographic Details
Main Author:	YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA
Format:	Final Project
Language:	Indonesia
Online Access:	https://digilib.itb.ac.id/gdl/view/15508
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Institut Teknologi Bandung
Language:	Indonesia

id	id-itb.:15508
spelling	id-itb.:155082017-09-27T11:45:08ZALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/15508 The study of cycles in a graph is one of interesting topics in graph theory. Such studies include the study of determining whether a graph having a Hamiltonian cycle or not; and the study of finding a smallest cycle in a given graph. Detecting cycles in graphs has also important applications in some other fields, for instances in chemistry, biology, computer science and others. The aim of this project is to propose an algorithm for detecting certain small cycles and/or a smallest cycle in a given graph. The algorithm has been implemented for detecting cycles on several well-known classes of graphs. 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	The study of cycles in a graph is one of interesting topics in graph theory. Such studies include the study of determining whether a graph having a Hamiltonian cycle or not; and the study of finding a smallest cycle in a given graph. Detecting cycles in graphs has also important applications in some other fields, for instances in chemistry, biology, computer science and others. The aim of this project is to propose an algorithm for detecting certain small cycles and/or a smallest cycle in a given graph. The algorithm has been implemented for detecting cycles on several well-known classes of graphs.
format	Final Project
author	YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA
spellingShingle	YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
author_facet	YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA
author_sort	YUDHA SULISTIANDA (NIM : 10108003); Pembimbing : Prof. Dr. Edy Tri Baskoro, EKA
title	ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
title_short	ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
title_full	ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
title_fullStr	ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
title_full_unstemmed	ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH
title_sort	algorithm for searching small cycles in graph
url	https://digilib.itb.ac.id/gdl/view/15508
_version_	1820737481794912256

ALGORITHM FOR SEARCHING SMALL CYCLES IN GRAPH

Similar Items