Author:
Chandran L. Sunil,Grandoni Fabrizio
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Cut-set graph and systematic generation of separating sets;Ariyoshi;IEEE Trans. Circuit Theory,1972
2. Generating all the minimal separators of a graph;Berry;Internat. J. Foundations Comput. Sci.,2000
3. L.S. Chandran, A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph, in: Proceedings of the Seventh International Computing and Combinatorics Conference, Lecture Notes in Computer Science, vol. 2108, Springer, Berlin, 2001, pp. 308–317.
4. Generating and characterizing the perfect elimination orderings of a chordal graph;Chandran;Theoret. Comput. Sci.,2003
5. Introduction to Algorithms;Cormen,1990
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献