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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorManku, Gurmeet Singh-
dc.date.accessioned2005-06-03T12:52:55Z-
dc.date.available2005-06-03T12:52:55Z-
dc.date.issued1996-
dc.identifier.citationInformation Processing Letters, 59(1), 1-7en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/235-
dc.description.abstractA 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.en
dc.format.extent617608 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.subjectAlgorithmsen
dc.subjectCombinatorial problemsen
dc.subjectBiconnectivityen
dc.titleA linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problemen
dc.typeArticleen
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