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

QSpace/Manakin Repository

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

Show full item record


Title: The P-Center And The P-Median Problems In Graphs With Small Number ' Of Spanning Trees
Author: Hassan, M. H. [محمد حسن حسن]
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)يعرض هذا البحث عدد من الخوارزميات مع حساب تعقيداتها وهي : .
URI: http://hdl.handle.net/10576/9880
Date: 1996

Files in this item

Files Size Format View
abstract.pdf 1.846Kb PDF View/Open
abstract.doc 20Kb Microsoft Word View/Open
abstract_ar.doc 20Kb Microsoft Word View/Open
0796161-0006-fulltext.pdf 463.6Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search QSpace


Advanced Search

Browse

My Account