|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Computer Science and Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/235
|
Full metadata record
| DC Field | Value | Language |
|---|
| contributor.author | Manku, Gurmeet Singh | - |
| date.accessioned | 2005-06-03T12:52:55Z | - |
| date.available | 2005-06-03T12:52:55Z | - |
| date.issued | 1996 | - |
| identifier.citation | Information Processing Letters, 59(1), 1-7 | en |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/235 | - |
| description.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. | en |
| format.extent | 617608 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | - |
| subject | Algorithms | en |
| subject | Combinatorial problems | en |
| subject | Biconnectivity | en |
| title | A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem | en |
| type | Article | en |
| Appears in Collections: | Computer Science and Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| mankulin96.pdf | | 603Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
