A statistical study of graph algorithms

Cardinal Scholar

Show simple item record

dc.contributor.advisor Wang, Chung-E en_US
dc.contributor.author Deel, Troy A. en_US
dc.date.accessioned 2011-06-03T19:34:05Z
dc.date.available 2011-06-03T19:34:05Z
dc.date.created 1985 en_US
dc.date.issued 1985
dc.identifier LD2489.Z78 1985 .D43 en_US
dc.identifier.uri http://cardinalscholar.bsu.edu/handle/handle/183156
dc.description.abstract The object of this paper is to investigate the behavior of some important graph properties and to statistically analyze the execution times of certain graph are the average degree of a vertex, connectivity of a graph, the existence of Hamilton cycles, Euler tours, and bipartitions in graphs. This study is unique in that it is based on statistical rather than deterministic methods. en_US
dc.format.extent v, 100 leaves : ill. ; 28 cm. en_US
dc.source Virtual Press en_US
dc.subject.lcsh Graph theory -- Data processing. en_US
dc.subject.lcsh Algorithms. en_US
dc.title A statistical study of graph algorithms en_US
dc.description.degree Thesis (M.S.) en_US
dc.identifier.cardcat-url http://liblink.bsu.edu/catkey/424871 en_US

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

  • Master's Theses [5510]
    Master's theses submitted to the Graduate School by Ball State University master's degree candidates in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


My Account