scientific article; zbMATH DE number 3228308
From MaRDI portal
Publication:5516565
zbMath0141.36301MaRDI QIDQ5516565
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, Further Algebraic Results in the Theory of Balance, On the use of ordered sets in problems of comparison and consensus of classifications, Mathematical Applications in Sociology: Measurement and Relations, Signed graphs with cut points whose positive inertia indexes are two, Metrics on partially ordered sets - a survey, Balancing signed graphs, The median procedure in cluster analysis and social choice theory, The complexity of computing metric distances between partitions, Higher order stability conditions in mathematical models of sociometric or cognitive structure, MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS, A distance model for sociometric structure†, Sociometric triads as multi‐variate systems†, THE LOGIC OF ROLE THEORY: ROLE CONFLICT AND STABILITY OF THE SELF-CONCEPT, Human centered processes and decision support systems, Dynamic evolution in societal networks, Graph theory, Graceful signed graphs: II. The case of signed cycles with connected negative sections, Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures, Probabilities of homomorphic mappings from multiple graphs, Agent Uncertainty Model and Quantum Mechanics Representation: Non-locality Modeling, Signed graphs with small positive index of inertia, The centrality index of a graph, The algebra of group kinship, Metrics on spaces of finite trees, A derivation of a measure of relative balance for social structures and a characterization of extensive ratio systems, Multidimensional scaling of measures of distance between partitions, Distributional Aspects of Some Statistics in Weighted Social Networks, Properties of Levenshtein metrics on sequences, A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs, A computationally efficient approximation to the nearest neighbor interchange metric
