4 citations found. Retrieving documents...
J. Cheriyan and R. Thurimella, "Fast Algorithms for k-shredders and k-node Connectivity Augmentation, " Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
On Rooted Node-Connectivity Problems - Cheriyan, Jordán, Nutov (1999)   (3 citations)  Self-citation (Cheriyan)   (Correct)

....conditions or directed node connectivity conditions, see the survey by Frank [5] For the node connectivity of undirected graphs, only one general splitting off result has been proved so far. This result is due to Bienstock, Brickell and Monma [1] see Theorem 4. Related results are in [8] and [4]. We generalize this result from k node connected graphs to k outconnected graphs by giving necessary and sufficient conditions for the existence of a pair of edges incident to the root r that can be split off while preserving k outconnectivity from r, see Theorem 3. jcheriyan math.uwaterloo.ca ....

J.Cheriyan and R.Thurimella, "Fast algorithms for k-shredders and k-node connectivity augmentation, " Journal of Algorithms 33 (1999), 15--50.


Network Failure Detection and Graph Connectivity - Jon Kleinberg Mark   (Correct)

No context found.

J. Cheriyan and R. Thurimella, "Fast Algorithms for k-shredders and k-node Connectivity Augmentation, " Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996.


Network Failure Detection and Graph Connectivity - Jon Kleinberg Mark (2004)   (1 citation)  (Correct)

No context found.

J. Cheriyan and R. Thurimella, "Fast Algorithms for k-shredders and k-node Connectivity Augmentation, " Proc. 28th Annual ACM Symposium on the Theory of Computing , 1996.


Network Failure Detection and Graph Connectivity - Jon Kleinberg Mark (2004)   (1 citation)  (Correct)

No context found.

J. Cheriyan and R. Thurimella, "Fast Algorithms for k-shredders and k-node Connectivity Augmentation, " Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996.

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