भारतीय प्रौद्योगिकी संस्थान दिल्ली
Indian Institute of Technology, Delhi
  • Login
View Item 
  •   Home
  • Faculty Research Publications
  • Electrical Engineering
  • View Item
  •   Home
  • Faculty Research Publications
  • Electrical Engineering
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Generation of vertex and edge cutsets

Thumbnail
View/Open
prasadgen92.pdf


Collections
  • Electrical Engineering [463]
Metadata
Show full item record
Author: Prasad, V C; Sankar, V; Rao, K S Prakasa

Advisor: Advisor

Date: 1992

Publisher:
Citation: Microelect

Series/Report no.:
Item Type: Article

Keywords: single source vertex; single sink vertex; all minimal vertex cutsets

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.
Contact Us
Shankar B. Chavan
Computer Applications Division
Central Library, IIT Delhi
shankar.chavan@library.iitd.ac.in
NDLTD
Shodhganga
NDL
ePrints@IISc
etd@IISc
IR@IIT Bombay
NewsClips @IITD
  • Facebook
  • twitter
  • youtube
  • instagram
  • pinterest
  • Linkedin

Browse

All of IITDCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister
Contact Us
Shankar B. Chavan
Computer Applications Division
Central Library, IIT Delhi
shankar.chavan@library.iitd.ac.in
NDLTD
Shodhganga
NDL
ePrints@IISc
etd@IISc
IR@IIT Bombay
NewsClips @IITD
  • Facebook
  • twitter
  • youtube
  • instagram
  • pinterest
  • Linkedin