Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Hegde, Rajneesh Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 1 of 1 reviews    
  Finding 3-shredders efficiently
Hegde R. ACM Transactions on Algorithms 2(1): 14-43, 2006.  Type: Article

A k-shredder in an undirected graph is a vertex cut of size k whose removal results in at least three components. The author presents a linear algorithm to find the set of 3-shredders in a 3-connected graph. The algorithm...
...
Jun 20 2006  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy