IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
Proceedings >
ADIS >
ADIS 2019 >

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

Title: Trees and Graphs: Simple, General, Abstract, and Efficient
Authors: Bantchev, Boyko
Keywords: graph
tree
representation
algorithm
set
map
Issue Date: 31-May-2019
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Association for the Development of the Information Society
Citation: Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2019, 010p-019p
Series/Report no.: ADIS;2019
Abstract: The representations of trees and graphs in general, as known from most textbooks on data structures and algorithms or similar sources, are in various ways deficient and outdated. We offer a straightforward approach, based on the notions of set and map, which is at once abstract, general, and efficient, and thus beneficial to the theory, practice, and teaching of programming.
Description: Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2019
URI: http://hdl.handle.net/10525/3313
ISSN: 2534-8663
Appears in Collections:ADIS 2019

Files in This Item:

File Description SizeFormat
ERIS2019_book_p02.pdf300.72 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License