DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/235

Title: A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
Authors: Manku, Gurmeet Singh
Keywords: Algorithms
Combinatorial problems
Biconnectivity
Issue Date: 1996
Citation: Information Processing Letters, 59(1), 1-7
Abstract: A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves theb hitherto best-known solution, which has a running time of 0( m + n log n), where m and n are the number of edges and vertices of the graph.
URI: http://eprint.iitd.ac.in/dspace/handle/2074/235
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
mankulin96.pdf603.13 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback