|
Tri-College DSpace Repository >
HAVERFORD COLLEGE >
Student Scholarship >
Senior Theses >
Computer Science >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10066/1485
|
| Title: | Empirical Study of Graph Properties with Particular Interest Towards Random Graphs |
| Author(s): | Weinstein, Lee |
| Advisor(s): | Lindell, Steven |
| Department: | Haverford College. Dept. of Computer Science |
| Abstract: | This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, radius, the eccentricity distribution, and the degree of the graph.
The goal is to see if random graphs models are ideal for networks which seek to minimize network traffic and still keep the distance between nodes small. |
| URI: | http://hdl.handle.net/10066/1485 |
| Appears in Collections: | Computer Science
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 2005WeinsteinL.pdf | Thesis | 903Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
