Search
Now showing items 1-1 of 1
The P-Center And The P-Median Problems In Graphs With Small Number ' Of Spanning Trees
(
Qatar University
, 1996 , Article)
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 ...