Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Computing Course Materials >
Fundamentals of Algorithms >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1316

Title: Trees
Authors: Choueiry, Berthe
Keywords: ACMCCS98::Mathematics of Computing::DISCRETE MATHEMATICS::Graph Theory::Trees
Issue Date: 2007
Abstract: A connected,acyclic,undirected graph is called as a Tree.
URI: http://www.citidel.org/handle/10117/1316
Appears in Collections:Fundamentals of Algorithms

Files in This Item:

File Description SizeFormat
Trees.pdf560KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback