Author:
Chein Michel,Mugnier Marie-Laure
Publisher
Springer International Publishing
Reference25 articles.
1. Arnborg, S., Corneil, D.G., Proskurovski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal Algebraic Discrete Methods (8), 277–284 (1987)
2. Berge, C.: Graphes et hypergraphes. Dunond (1970)
3. Chein, M., Mugnier, M.L.: Conceptual Graphs: fundamental notions. Revue d’Intelligence Artificielle 6(4) (1992) (in English)
4. Lecture Notes in Computer Science;G. Ellis,1993
5. Freuder, E.C.: A sufficient condition for backtrack-free search. JACM, 29–45 (1982)