Separators are as simple as cutsets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1742, Issue , 1999, Pages 347-358

  Shen, Hong ^a   Li, Keqin ^b   Zheng, Si Qing ^c  

^a GRIFFITH UNIVERSITY   (Australia)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c The University of Texas at Dallas   (United States)

Author keywords

Algorithms; Complexity analysis; Cutsets; Data structures; Separators

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY;

COMPLEXITY ANALYSIS; CONNECTED GRAPH; CUT SETS; EDGE-SETS; NONADJACENT VERTICES; TIME COMPLEXITY; VERTEX SET;

SEPARATORS;

EID: 34547722436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46674-6_29     Document Type: Conference Paper

References (13)

1. H. Ariyoshi, Cut-set graph and systematic generation of separating sets, IEEE Trans. Circuit Theory CT-19(3) (1972) 233-240.
2. S. Arnberg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey, BIT 25 (1985) 2-23.
3. A. Gibbons, Algorithmic Graph Theory, Cambridge Univ. Press, 1985.
4. L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cam-bridge Univ. Press, 1993.
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
6. D.S. Hirschberg, A.K. Chandra and D.V. Sarwate, Computing connected compo-nents on parallel computers, Commu. ACM 22(8) (1979) 461-464.
7. A. Kanevsky, On the number of minimum size separating vertex sets in a graph and how to find all of them, Proc. 1st Ann. ACM-SIAM Symp. Discrete Algorithms (1990) 411-421.
8. T. Kloks and D. Kratsh, Finding all minimal separators of a graph, Proc. Theoretical Aspects of Computer Sci. LNCS 775 (1994) 759-767.
9. D.E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley, 1973.
10. E.M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs (1977).
11. H. Shen and W. Liang, Efficient enumeration of all minimal separators in a graph, Theoretical Computer Science 180 (1997) 169-180.
12. H. Shen, K. Li and S.Q. Zheng, Separators are as simple as cutsets (long version), manuscript.
13. S. Tsukiyama, I. Shirakawa and H. Ozaki, An algorithm to enumerate all cutsets of a graph in linear time per cutset, J. ACM 27(4) (1980) 619-632.