Home
Tags
No Tags
LABELING SCHEMES FOR SOME LOCATION PROBLEMS ON TREES
| Title: | LABELING SCHEMES FOR SOME LOCATION PROBLEMS ON TREES |
| Author: | Bafna, Nitin Nemichand |
| Description: | Mostly all location problems are based on all nodes of a tree. However, in data communication networks only some nodes are communicating with data repository at a particular instance of time. In this thesis, labeling schemes and algorithms for some location problems on set of active nodes in a tree are presented. Let n be the total number of nodes in a tree T and at particular instance only K nodes be active. This thesis concentrates on solving location problems on set of K active nodes such as Median, Center and Diameter. We have also covered both cases such as relative and absolute center and relative and absolute median while considering the center and median problems. |
| Permanent Link: |
http://rave.ohiolink.edu/etdc/view?acc_num=kent1178309019
http://hdl.handle.net/2374.OX/17762 |
| Date: | 2007 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||