Doubly lexical orderings of matrices
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A generalized algorithm for centrality problems on trees
Journal of the ACM (JACM)
Information Processing Letters
Journal of Parallel and Distributed Computing
Network file storage with graceful performance degradation
ACM Transactions on Storage (TOS)
Discrete Applied Mathematics
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
A two-phase multicast routing in MANETs using Steiner connected dominating core sets
International Journal of Ad Hoc and Ubiquitous Computing
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
Vertex fusion under distance constraints
European Journal of Combinatorics
Approximating the Spanning k-Tree Forest Problem
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Discrete Applied Mathematics
A memory efficient self-stabilizing algorithm for maximal k-packing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Optimal broadcast domination of arbitrary graphs in polynomial time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Independent domination in chordal graphs
Operations Research Letters
Operations Research Letters
Total domination in block graphs
Operations Research Letters
| Hi-index | 0.00 |
The problem of finding a minimum k-basis of graph G is that of selecting as small a set B of vertices as possible such that every vertex of G is at distance k or less from some vertex in B. Cockayne, Goodman, and Hedetniemi previously developed a linear algorithm to find a minimum 1-basis (a minimum dominating set) when G is a tree. In this paper the k-basis problem is placed in a more general setting, and a linear algorithm is presented that solves the problem for any forest.