Caro, T., West, D.B. and Yuster, R.: Connected Domination and Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 13(2) (2000) 202--211 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dominating a Family of Graphs With Small Connected Subgraphs - Caro, Yuster Self-citation (Caro Yuster) (Correct)
....in [10, 11] Caro [4] has considered k domination numbers and showed an analog result to the one obtained by Lov asz, under the (obviously necessary) assumption that ffi k. Thus, he showed that fl(k; G) n ln ffi ffi (1 o ffi (1) Considering connected domination, Caro, West and Yuster [5] have shown by more complicated arguments that the bound obtained by Lov asz also holds in this much more restricted case, namely fl c (k; G) n ln ffi ffi (1 o ffi (1) Their result also supplies a sequential deterministic algorithm which produces a connected dominating set with (at most) ....
Y. Caro, D. West and R. Yuster, Connected domination and spanning trees with many leaves, submitted.
On the Connected Domination Number of Random Regular Graphs - Duckworth, Mans (Correct)
No context found.
Caro, T., West, D.B. and Yuster, R.: Connected Domination and Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 13(2) (2000) 202--211
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC