|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Electrical Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/2524
|
Full metadata record
| DC Field | Value | Language |
|---|
| contributor.author | Prasad, V C | - |
| contributor.author | Sankar, V | - |
| contributor.author | Rao, K S Prakasa | - |
| date.accessioned | 2007-02-27T03:47:32Z | - |
| date.available | 2007-02-27T03:47:32Z | - |
| date.issued | 1992 | - |
| identifier.citation | Microelectronics and Reliability, 32(9), 1291-1310p. | en |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/2524 | - |
| description.abstract | An 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 |
| format.extent | 278548 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| subject | single source vertex | en |
| subject | single sink vertex | en |
| subject | all minimal vertex cutsets | en |
| title | Generation of vertex and edge cutsets | en |
| type | Article | en |
| Appears in Collections: | Electrical Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| prasadgen92.pdf | | 272Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
