DSpace Repository

Graph Representation Comparative Study

Show simple item record

dc.contributor.author Arman, Nabil
dc.date.accessioned 2017-01-23T07:46:07Z
dc.date.available 2017-01-23T07:46:07Z
dc.date.issued 2005
dc.identifier.uri http://scholar.ppu.edu/handle/123456789/100
dc.description.abstract There are a number of graph representation schemes that have been used in graph algorithms. In this short article, a comparison is conducted among three major representations of directed graphs to illustrate the main advantages and disadvantages of each representation scheme. The reason for conducting this study is to show that one of the schemes is overlooked despite the fact that it has more information than the other schemes and this information is very useful in improving the performance of many graph algorithms. en_US
dc.language.iso en_US en_US
dc.publisher 2005 International Conference on Foundations of Computer Science (FCS'05) en_US
dc.subject Graph Representation, Path Matrix Representation en_US
dc.title Graph Representation Comparative Study en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account