Assyrian merchants meet nuclear physicists: history of the early contributions from social sciences to computer science. The case of automatic pattern detection in graphs (1950s–1970s)

References

• Arsac, Jacques. 1988. “Des ordinateurs à l'informatique (1952–1972).” In L'histoire de l'informatique en France, edited by Philippe Chatelin, Vol. 1, 31–43. Grenoble: Institut national polytechnique de Grenoble.
   Google Scholar
• Barthélemy, Jean-Pierre, and Alain Guénoche. 1988. Les arbres et les représentations des proximités. Méthode + programmes 28. Paris and Milan and Barcelone: Masson.
   Google Scholar
• Beum, Corlin O., and Everett G. Brundage. 1950. “A Method for Analyzing the Sociomatrix.” Sociometry13 (2): 141–145.
   Google Scholar
• Braffort, Paul. 1968. L'intelligence artificielle. La Science Vivante. Paris: Presses universitaires de France.
   Google Scholar
• Braffort, Paul, and Adriano Gazzano. 1961. “Le calcul électronique à Euratom.” L'onde électrique 16 (406): 54–56.
   Google Scholar
• Bron, Coenraad, and Joep Kerbosch. 1973. “Finding All Cliques of an Undirected Graph (algorithm 457).” Communications of the ACM 16 (9): 575–576.
   Web of Science ®Google Scholar
• Coleman, James S., and Duncan MacRae. 1960. “Electronic Processing of Sociometric Data for Groups Up to 1000 in Size.” American Sociological Review 25 (5): 722–727.
   Web of Science ®Google Scholar
• Dallas, Costis. 2015. “Jean-Claude Gardin on Archaeological Data, Representation and Knowledge: Implications for Digital Archaeology.” Journal of Archaeological Method and Theory 23 (1): 305–330.
   Web of Science ®Google Scholar
• De Mol, Liesbeth, and Maarten Bullynck. 2008. “A Week-end off: The First Extensive Number-Theoretical Computation on the ENIAC.” In Logic and Theory of Algorithms, edited by Arnold Beckmann, Costas Dimitracopoulos, and Benedikt Löwe, 158–167. Berlin and Heidelberg: Springer.
   Google Scholar
• De Mol, Liesbeth, and Giuseppe Primiero. 2014. “Facing Computing as Technique: Towards a History and Philosophy of Computing.” Philosophy & Technology 27 (2): 321–326.
   Google Scholar
• Dixon, Anthony Hunter. 1973. “On the Efficiency of Clique Detection in Graphs.” PhD diss., The University of British Columbia.
   Google Scholar
• Doreian, Patrick. 1969. “A Note on the Detection of Cliques in Valued Graphs.” Sociometry 32 (2): 237–242.
   Google Scholar
• Eppstein, David, Maarten Löffler, and Darren Strash. 2010. “Listing all Maximal Cliques in Sparse Graphs in Near-optimal Time.” In International Symposium on Algorithms and Computation, 403–414. Berlin and Heidelberg: Springer.
   Google Scholar
• Espirat, Jean-Jacques, Jean Guiart, Marie-Salomé Lagrange, and Monique Renaud. 1973. Système des titres, électifs ou héréditaires dans les Nouvelles-Hébrides centrales, d'Efate aux îles Shepherd. Mémoires de l'Institut d'ethnologie 10. Paris: Institut d'ethnologie.
   Google Scholar
• Festinger, Leon. 1949. “The Analysis of Sociograms Using Matrix Algebra.” Human Relations 2 (2): 153–158.
   Web of Science ®Google Scholar
• Flament, Claude. 1963. Applications of Graph Theory to Group Structure. Prentice-Hall Series in Mathematical Analysis of Social Behavior. Englewood Cliffs, NJ: Prentice-Hall Inc.
   Google Scholar
• Flament, Claude. 1965. Théorie des graphes et structures sociales. Mathématiques et sciences de l'homme 2. Paris and La Haye: Mouton and Gauthier-Villars.
   Google Scholar
• Forsyth, Elaine, and Leo Katz. 1946. “A Matrix Approach to the Analysis of Sociometric Data: Preliminary Report.” Sociometry 9 (4): 340–347.
   Google Scholar
• Freeman, Linton C. 1988. “Computers Programs and Social Network Analysis.” Connections 11 (2): 26–31.
   Google Scholar
• Freeman, Linton C. 2004. The Development of Social Network Analysis. Vancouver, BC: Empirical Press.
   Google Scholar
• Gardin, Jean-Claude. 1960. “Les applications de la mécanographie dans la documentation archéologique.” Bulletin des bibliothèques de France 5 (1–3): 5–16.
   Google Scholar
• Gardin, Jean-Claude. 1961. “Détermination du réseau économique des Marchands Assyriens en Cappadoce (19e siècle avant J.C.) d'après l'analyse de leurs archives (Exploitation sur ordinateur IBM 650).” In Comptes-rendus du Séminaire sur les Modèles Mathématiques dans les Sciences Sociales. Année 1960–1961, 23–26. Paris: École pratique des hautes études: Groupe de mathématique sociale et de statistique.
   Google Scholar
• Gardin, Jean-Claude. 1962a. “Cartes perforées et ordinateurs au service de l'archéologie.” La Nature 3331: 449–457.
   Google Scholar
• Gardin, Jean-Claude. 1962b. “De l'archéologie à l'information automatique.” Euratom. Bulletin d'Information de la Communauté européenne de l'énergie atomique 4: 25–29.
   Google Scholar
• Gardin, Jean-Claude. 1965a. “A Typology of Computer Uses in Anthropology.” In The Use of Computers in Anthropology, edited by Dell H. Hymes, Studies in Anthropology, 103–117. La Haye: Mouton & co.
   Google Scholar
• Gardin, Jean-Claude. 1965b. “Les travaux de la Section d'Automatique Documentaire (Institut Blaise Pascal, C.N.R.S.), 1961–1965.” T.A. Informations, Vol. 1–2, 9–24.
   Google Scholar
• Gardin, Jean-Claude. 1965c. “Reconstructing an Economic Network in the Ancient East with a Computer.” In The Use of Computers in Anthropology, edited by Dell H. Hymes, Studies in Anthropology, 377–391. La Haye: Mouton & co.
   Google Scholar
• Gardin, Jean-Claude, and Paul Garelli. 1961. “Étude des établissements assyriens en Cappadoce par ordinateur.” Annales. Histoire, Sciences Sociales 16 (5): 837–876.
   Google Scholar
• Gardin, Jean-Claude, and Bernard Jaulin, eds. 1968. Calcul et formalisation dans les sciences de l'homme. Paris: Éditions du CNRS.
   Google Scholar
• Hage, Per, and Frank Harary. 1983. Structural Models in Anthropology. Cambridge Studies in Social Anthropology 46. Cambridge: Cambridge University Press.
   Google Scholar
• Haigh, Thomas, Mark Priestley, and Crispin Rope. 2014. “Los Alamos Bets on ENIAC: Nuclear Monte Carlo Simulations, 1947–1948.” IEEE Annals of the History of Computing 36 (3): 42–63.
   Web of Science ®Google Scholar
• Halleux, Robert, and Geneviève Xhayet. 2007. La liberté de chercher. Histoire du Fonds national belge de la recherche scientifique. Liège: Les éditions de l'Université de Liège.
   Google Scholar
• Harary, Frank. 1970. “Graph Theory as a Structural Model in the Social Sciences.” In Graph Theory and its Applications, edited by Bernard Harris, Mathematics Research Center 24, 1–16. New York: Academic Press.
   Google Scholar
• Harary, Frank, and Ian C. Ross. 1957. “A Procedure for Clique Detection Using the Group Matrix.” Sociometry 20 (3): 205–215.
   Google Scholar
• Hubbell, Charles H. 1965. “An Input-output Approach to Clique Identification.” Sociometry 28 (4): 377–399.
   Google Scholar
• Jaulin, Bernard. 1961. “Sur une méthode de détermination des cliques dans un graphe symétrique.” In Comptes-rendus du Séminaire sur les Modèles Mathématiques dans les Sciences Sociales. Année 1960–1961, 50–57. Paris: École pratique des hautes études: Groupe de mathématique sociale et de statistique.
   Google Scholar
• Karp, Richard M. 1972. “Reducibility Among Combinatorial Problems.” In Complexity of Computer Computations, edited by Raymond E. Miller and James W. Thatcher, 85–103. New York: Plenum.
   Google Scholar
• Lankford, Philip M. 1974. “Comparative Analysis of Clique Identification Methods.” Sociometry 37 (2): 287–305.
   Google Scholar
• Luce, R. Duncan, and Albert D. Perry. 1949. “A Method of Matrix Analysis of Group Structure.” Psychometrika 14 (2): 95–116.
   PubMed Web of Science ®Google Scholar
• Makino, Kazuhisa, and Takeaki Uno. 2004. “New Algorithms for Enumerating All Maximal Cliques.” In Algorithm Theory – SWAT 2004, edited by Torben Hagerup and Jyrki Katajainen, 260–272. Berlin: Springer-Verlag.
   Google Scholar
• Moon, J. W., and L. Moser. 1965. “On Cliques in Graphs.” Israel Journal of Mathematics 3 (1): 23–28.
   Web of Science ®Google Scholar
• Mounier-Kuhn, Pierre-Éric. 2012. “Computer Science in French Universities: Early Entrants and Latecomers.” Information & Culture 47 (4): 414–456.
   Web of Science ®Google Scholar
• Newman, Mark E. J., and Michelle Girvan. 2004. “Finding and Evaluating Community Structure in Networks.” Physical Review E 69: 026113.
   PubMed Web of Science ®Google Scholar
• Nofre, David. 2014. “Managing the Technological Edge: The UNESCO International Computation Centre and the Limits to the Transfer of Computer Technology, 1946–1961.” Annals of Science 71 (3): 410–431.
   PubMed Web of Science ®Google Scholar
• NSF. 1959. Science Information Notes. National Science Foundation (U.S.).
   Google Scholar
• Östergård, Patric R. J. 2001. “A New Algorithm for the Maximum-weight Clique Problem.” Nordic Journal of Computating 8: 424–436.
   Google Scholar
• Pardalos, Panos M., and Jue Xue. 1994. “The Maximum Clique Problem.” Journal of Global Optimization 4: 301–328.
   Web of Science ®Google Scholar
• Paull, Marvin C., and Stephen H. Unger. 1959. “Minimizing the Number of States in Incompletely Specified Sequential Switching Functions.” IEEE Transactions on Electronic Computers EC-8(3): 356–367.
   Google Scholar
• Plutniak, Sébastien. 2017. “Is An Archaeological Contribution to the Theory of Social Science Possible? Archaeological Data and Concepts in the Dispute Between Jean-Claude Gardin and Jean-Claude Passeron.” Palethnologie 9: 7–21.
   Google Scholar
• Plutniak, Sébastien. 2018. “Aux prémices des humanités numériques ? La première analyse automatisée d'un réseau économique ancien (Gardin & Garelli, 1961). Réalisation, conceptualisation, réception.” ARCS 1. https://hal.archives-ouvertes.fr/hal-01870945.
   Google Scholar
• Schneider, Michel. 1973. “Méthodes pour recenser toutes les cliques maximales et q-maximales d'un graphe.” Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle 7 (V3): 21–33.
   Google Scholar
• Wasserman, Stanley, and Katherin Faust. 1994. Social Network Analysis. Cambridge: Cambridge University Press.
   Google Scholar