CitedEvidence
User Settings
Article

A statistical study of graph algorithms

Troy A. Deel-1985-01-01-Cardinal Scholar (Ball State University)
0

TL;DRAbstract

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.

Chat with Paper

AI Agents for this Paper

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.

Keywords

Computer scienceAlgorithmGraphMathematicsTheoretical computer science

Chat

Click to start Chat