The P-Center And The P-Median Problems In Graphs With Small Number ' Of Spanning Trees

Show simple item record

Author Hassan, M. H. [محمد حسن حسن] en_US
Available date 2009-11-25T15:20:22Z en_US
Publication Date 1996 en_US
Citation Qatar University Science Journal, 1996, Vol. 16, No. 1, Pages 31-37. en_US
URI http://hdl.handle.net/10576/9880 en_US
Abstract In this paper, we will describe some algorithms and give their complexity as following: (1) The algorithm for finding a dominating set of radius r in a vertex-weighted graph with small number of spanning tress. The complexity of this algorithm for the unicyclic graph is O(m.n). (2) The algorithm for finding an absolute and vertex p-center of a vertex-weighted graph with small number of spanning trees. The complexity of determining the p-center is O(m.n2 Ign) for absolute (resp., O(n2 Ign) for vertex) p-center in unicyclic graphs. (3) The algorithm for finding a p-median in a vertex-weighted graph with mall number of spanning tress. The complexity of this algorithm for the class of unicyclic graphs is O(m.n2.p2) en_US
Abstract يعرض هذا البحث عدد من الخوارزميات مع حساب تعقيداتها وهي : . ar
Language en en_US
Publisher Qatar University en_US
Subject Mathematics en_US
Subject الرياضيات ar
Title The P-Center And The P-Median Problems In Graphs With Small Number ' Of Spanning Trees en_US
Alternative Title مشكلة إيجاد P - مركز و P - وسط لبيان يحوي عدد صغير من الهياكل ar
Type Article en_US
Pagination 31-37 en_US
Issue Number 1 en_US
Volume Number 16 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record