A constraint logic programming approach for generating all perfect matchings
暂无分享,去创建一个
[1] K. Fukuda,et al. Finding All The Perfect Matchings in Bipartite Graphs , 1989 .
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] Musiri M. Balakrishnarajan,et al. An artificial intelligence approach for the generation and enumeration of perfect matchings on graphs , 1995 .
[4] Leon Sterling,et al. The Art of Prolog , 1987, IEEE Expert.
[5] Pieter H. Hartel,et al. Programming Languages: Implementations, Logics, and Programs , 1996, Lecture Notes in Computer Science.
[6] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[7] M. M. Balakrishnarajan,et al. Heuristic enhancements of the search for the generation of all perfect matchings , 1996 .
[8] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.