A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph

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

Volumn 2108, Issue , 2001, Pages 308-317

  Sunil Chandran, L ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMBINATORIAL MATHEMATICS;

CHORDAL GRAPHS; LINEAR-TIME ALGORITHMS; UPPER BOUND;

SEPARATORS;

EID: 17444398833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_34     Document Type: Conference Paper

References (22)

1. H. Ariyoshi.: Cut-set graph and systematic generation of separating sets. IEEE Transactions on circuit theory, CT-19 (1972) 233-240.
2. G.A. Dirac, On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76,1961.
3. S. Even, R.E. Tarjan, Network Flow And Testing Graph Connectivity SIAM J. Comp. 4(4) 507-518, December 1975.
4. H.N. Gabow, Using Expander Graphs to Find Vertex Connectivity. Annual Symposium on Foundations of Computer Science, 2000.
5. L.A. Goldberg, Efficient Algorithms For Listing Combinatorial Structures. Cambridge University Press, Cambridge, 1993.
6. M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs. Academic Press, New York, 1980.
7. F. Harary, Graph Theory. Addison-Wesley Reading, MA, 1969.
8. Hong Shen and Weifa Liang, Efficient Enumeration Of All Minimal Separators In A Graph Theoretical Computer Science, 180 (1-2) 169-180, 10 June 1997
9. A. Kanevsky, Finding All Minimum Size Separating VertexSets In Graphs. NETWORKS, 23 533-541, 1993.
10. T. Kloks and D. Kratsch, Listing All Minimal Separators Of A Graph SIAM J. Comput. 27(3) 605-613 June 1998
11. T. Kloks, H. Bodlaender and D. Kratsch, Treewidth And Path Width Of Permutation Graphs SIAM J. Descrete Math. 8, 606-616, 1995.
12. T. Kloks, Treewidth - Computations And Approximations. Lecture Notes In Computer Science 842, Springer Verlag, Berlin 1994.
13. T. Kloks.: Treewidth Of Circle Graphs. Int. J. Of Foundations In Comp. Sci., 7 111-120, 1996.
14. T. Kloks and D. Kratsch, Treewidth Of Chordal Bipartite Graphsa. J. Algorithms, 19, 266-281 1995.
15. R.H. Mohring.: Graph Problems Related To Gate Matrix Layout And PLA Folding. Computational Graph Theory, Pages 17-52, Springer, Wein, New York, 1990.
16. Monika R Henzinger, A Static 2-Approximation Algorithm For Vertex Connectivity And An Incremental Approximation Algorithm For Edge And Vertex Connectivity. J. of Algorithms 24(1) 194-220 July 1997
17. Monika R Henzinger, Satish Rao, and H.N. Gabow, Computing Vertex Connectivity: New Bounds From Old Techniques. 37th Anual Symposium On Foundations Of Computer Science, 462-471 Oct. 1996.
18. Samir Khuller and Baruch Schieber, k-Connectivity And Finding Disjoint s-t Paths In Graphs. SIAM J. Comp. 20(2) 352-375 April 1991
19. Shimon Even.: An Algorithm For Determining Whether The Connectivity Of A Graph Is At Least k. SIAM J. Comp. 4(3) 393-396 September 1975.
20. M. Yannakakis, Computing The Minimum Fill-in Is NP-Complete SIAM J. on Alge. Discre. Math. 2 77-79, 1981.
21. M. Yannakakis and R.E. Tarjan, Simple Linear Time Algorithms To Test Chordality of Graphs, Test Acyclicity of hypergraphs and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput.13,566-579, 1984
22. Zvi Galil, Finding The Vertex Connectivity Of Graphs. SIAM J. Compu. 9(1) 197-199 Feb 1980.