A New Graph Data Structure

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

Show full item record

Files Size Format View
brandon_sorg_thesis.pdf 340.8Kb PDF View/Open

Title: A New Graph Data Structure
Creators: Sorg, Brandon
Advisor: Weide, Bruce
Issue Date: 2010-06
Abstract: A new data structure for graph representation has at least as good time efficiency as either of the two traditional data structures, the adjacency matrix and adjacency list, for any graph algorithm. For some algorithms, this new data structure actually produces a lower asymptotic bound than either of the other two. It is overall faster in practice as well and perhaps the best choice for general-purpose graph representation. A general-purpose sub-data structure is used to implement this new graph data structure and has applications of its own outside graph implementation.
Embargo: No embargo
Series/Report no.: The Ohio State University. Department of Computer Science and Engineering Honors Theses; 2010
Keywords: Graphs
Data Structures
URI: http://hdl.handle.net/1811/45709
Bookmark and Share
Attribution-NonCommercial-ShareAlike 3.0 Unported This item is licensed under a Creative Commons License:
Attribution-NonCommercial-ShareAlike 3.0 Unported