Author:
Shen Hong,Li Keqin,Zheng Si-Qing
Publisher
Springer Berlin Heidelberg
Reference13 articles.
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, Cambridge Univ. Press, 1993.
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A local approach to concept generation;Annals of Mathematics and Artificial Intelligence;2007-06-08
2. Representing a concept lattice by a graph;Discrete Applied Mathematics;2004-11