FINDING FIRST, SECOND AND THIRD ORDER GRAPH CUTS

Authors

  • A. A. Grishkevich Author
  • L. Piatek Author
  • A. Burmutaev Author

Abstract

An effective method for finding 1-, 2-, 3-order cuts based on procedure of finding all minimal cut graph sets is offered,i.e. a method for finding the cuts which are not being minimal.

Issue

№ 15 (115), выпуск 1

Section

Mathematical Modelling