DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Electrical Engineering >

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorPrasad, V C-
dc.contributor.authorSankar, V-
dc.contributor.authorRao, K S Prakasa-
dc.date.accessioned2007-02-27T03:47:32Z-
dc.date.available2007-02-27T03:47:32Z-
dc.date.issued1992-
dc.identifier.citationMicroelectronics and Reliability, 32(9), 1291-1310p.en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/2524-
dc.description.abstractAn algorithm is proposed to obtain basic minimal paths from basic minimal path tree for a network having a single source vertex and a single sink vertex. This does not require generation of all minimal paths. Using the paths thus obtained. A simple method is suggested to obtain all minimal vertex cutsets of any graph using OR and AND logic expressions. These paths can also be used to obtain all minimal edge cutsets which is advantageous for sparse graphs.en
dc.format.extent278548 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectsingle source vertexen
dc.subjectsingle sink vertexen
dc.subjectall minimal vertex cutsetsen
dc.titleGeneration of vertex and edge cutsetsen
dc.typeArticleen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
prasadgen92.pdf272.02 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