Efficient enumeration of all minimal separators in a graph

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 169-180

  Shen, Hong ^a   Liang, Weifa ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MINIMAL SEPARATORS; NON ADJACENT VORTEX SETS;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; PROGRAM PROCESSORS; SET THEORY;

COMPUTATION THEORY;

EID: 0031163960     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)83809-1     Document Type: Article

References (11)

1. H. Ariyoshi, Cut-set graph and systematic generation of separating sets, IEEE Trans. Circuit Theory CT-19 (1972) 233-240.
2. S. Arnberg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability -a survey, BIT 25 (1985) 2-23.
3. K.W. Chong and T.W. Lam, Connected components in O(log n log log n) time on the EREW PRAM, in: Proc. 4th Ann. ACM-SIAM Symp. Discrete Algorithms (1993) 11-20.
4. A. Gibbons, Algorithmic Graph Theory (Cambridge Univ. Press, Cambridge, 1985).
5. L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures (Cambridge Univ. Press, Cambridge, 1993).
6. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
7. D.S. Hirschberg, A.K. Chandra and D.V. Sarwate, Computing connected components on parallel computers, Comm. ACM 22 (1979) 461-464.
8. A. Kanevsky, On the number of minimum size separating vertex sets in a graph and how to find all of them, in: Proc. 1st Ann. ACM-SIAM Symp. Discrete Algorithms (1990) 411-421.
9. T. Kloks and D. Kratsh, Finding all minimal separators of a graph, in: Proc. Theoretical Aspects of Computer Sci., Lecture Notes in Computer Science, Vol. 775 (Springer, Berlin, 1994) 759-767.
10. D.E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
11. S. Tsukiyama, I. Shirakawa and H. Ozaki, An algorithm to enumerate all cutsets of a graph in linear time per cutset, J. ACM 27 (1980) 619-632.