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 |
| Summary: | 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. |
|---|