Minimal congestion trees
Analyzes the results of M.I. Ostrovskii's theorem of inequalities which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete grap...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
CSUSB ScholarWorks
2006
|
| Subjects: | |
| Online Access: | https://scholarworks.lib.csusb.edu/etd-project/3005 https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=4022&context=etd-project |
| id |
ndltd-csusb.edu-oai-scholarworks.lib.csusb.edu-etd-project-4022 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-csusb.edu-oai-scholarworks.lib.csusb.edu-etd-project-40222019-10-23T03:34:14Z Minimal congestion trees Dawson, Shelly Jean Analyzes the results of M.I. Ostrovskii's theorem of inequalities which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion tree for some grids while forming a conjecture for all grids. 2006-01-01T08:00:00Z text application/pdf https://scholarworks.lib.csusb.edu/etd-project/3005 https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=4022&context=etd-project Theses Digitization Project CSUSB ScholarWorks Trees (Graph theory) Trees (Graph theory) Mathematics |
| collection |
NDLTD |
| format |
Others
|
| sources |
NDLTD |
| topic |
Trees (Graph theory) Trees (Graph theory) Mathematics |
| spellingShingle |
Trees (Graph theory) Trees (Graph theory) Mathematics Dawson, Shelly Jean Minimal congestion trees |
| description |
Analyzes the results of M.I. Ostrovskii's theorem of inequalities which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion tree for some grids while forming a conjecture for all grids. |
| author |
Dawson, Shelly Jean |
| author_facet |
Dawson, Shelly Jean |
| author_sort |
Dawson, Shelly Jean |
| title |
Minimal congestion trees |
| title_short |
Minimal congestion trees |
| title_full |
Minimal congestion trees |
| title_fullStr |
Minimal congestion trees |
| title_full_unstemmed |
Minimal congestion trees |
| title_sort |
minimal congestion trees |
| publisher |
CSUSB ScholarWorks |
| publishDate |
2006 |
| url |
https://scholarworks.lib.csusb.edu/etd-project/3005 https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=4022&context=etd-project |
| work_keys_str_mv |
AT dawsonshellyjean minimalcongestiontrees |
| _version_ |
1719275475373654016 |