Normal view MARC view ISBD view

An enhancement of reverse-delete algorithm in application of plat map deployment program / Carausos, Peb Marco and Sepnio, Jose Lorenzo D. 6

By: Carausos, Peb Marco and Sepnio, Jose Lorenzo D. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; May 2010.46Edition: Description: 28 cm. 41 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: Reverse-delete algorithm - is an algorithm in graph theory used to obtain a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. Descriptive research is used in this study. There are modifications on the enhanced algorithm. These changes are made to answer the problems and meet the proponents objectives. Further Enhancement is applied to improve the algorithms performance. This research shows that the algorithm can be used to help improve applications such as the text editor that is very common and useful nowadays. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Archives	Filipiniana-Thesis	383 (Browse shelf)	Available		FT6173

Total holds: 0

Browsing PLM Shelves , Shelving location: Archives , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	380 Dialogue inventory system /	381 Jan Owen Martin Construction and Industries Corporation inventory system /	382 Enhancement of the astar (A*) algorithm for path-finding /	383 An enhancement of reverse-delete algorithm in application of plat map deployment program /	384 Enhancement of brute force search algorithm applied in boggle word search /	385 Prodline enterprises co. inventory system /	386 Materials management system /	Next

Undergraduate Thesis: (Bachelor of Science in Computer Science)- Pamantasan ng Lungsod ng Maynila, 2010. 56

ABSTRACT: Reverse-delete algorithm - is an algorithm in graph theory used to obtain a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. Descriptive research is used in this study. There are modifications on the enhanced algorithm. These changes are made to answer the problems and meet the proponents objectives. Further Enhancement is applied to improve the algorithms performance. This research shows that the algorithm can be used to help improve applications such as the text editor that is very common and useful nowadays.

There are no comments for this item.

to post a comment.