Show simple item record

dc.contributor.authorShen, Hong
dc.contributor.authorLiang, W.
dc.date.accessioned2019-12-04T05:37:02Z
dc.date.available2019-12-04T05:37:02Z
dc.date.issued1997
dc.identifier.issn03043975
dc.identifier.doi10.1016/S0304-3975(97)83809-1
dc.identifier.urihttp://hdl.handle.net/10072/121201
dc.description.abstractThis paper presents an efficient algorithm for enumerating all minimal a-b separators separat- ing given non-adjacent vertices a and b in an undirected connected simple graph G = (V,E). Our algorithm requires O(n3R,b) time, which improves the known result of 0(n4R,b) time for solving this problem, where |V| = n and R(ab) is the number of minimal a-b separators. The algorithm can be generalized for enumerating all minimal A-B separators that separate non-adjacent vertex sets A,B < V, and it requires O(n2(n - no - nB)R(AB)) time in this case, where n(a) = |A|, n(b) = |B| and r(ab) is the number of all minimal A-B separators. Using the algorithm above as a routine, an efficient algorithm for enumerating all minimal separators of G separating G into at least two connected components is constructed.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherNorth-Holland
dc.publisher.placeNetherlands
dc.relation.ispartofpagefrom169
dc.relation.ispartofpageto180
dc.relation.ispartofissue1-2
dc.relation.ispartofjournalTheoretical Computer Science
dc.relation.ispartofvolume180
dc.subject.fieldofresearchMathematical Sciences
dc.subject.fieldofresearchInformation and Computing Sciences
dc.subject.fieldofresearchcode01
dc.subject.fieldofresearchcode08
dc.titleEfficient enumeration of all minimal separators in a graph
dc.typeJournal article
dc.type.descriptionC1 - Peer Reviewed (HERDC)
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorShen, Hong


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record