Return to search

A statistical study of graph algorithms

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.

Identiferoai:union.ndltd.org:BSU/oai:cardinalscholar.bsu.edu:handle/183156
Date03 June 2011
CreatorsDeel, Troy A.
ContributorsWang, Chung
Source SetsBall State University
Detected LanguageEnglish
Formatv, 100 leaves : ill. ; 28 cm.
SourceVirtual Press

Page generated in 0.0032 seconds