Results 41 to 50 of about 2,686,069 (331)
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
Information, 2020 We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications.
Jörg Schäfer
doaj +1 more source
Annals of Pure and Applied Logic, 2017 In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of
openaire +4 more sources
Which Graphs Occur as $$\gamma $$-Graphs? [PDF]
Graphs and Combinatorics, 2020 Comment: 28 pages, 5 figures, 2 appendices.
Matt DeVos +3 more
openaire +2 more sources
Gain Scores, ANCOVA, and Propensity Matching Procedures for Evaluating Treatments in Education
Open Education Studies, 2020 Researchers have several options available to analyze data from interventions when participants have not been randomly allocated into conditions. Among these are the gain score, ANCOVA, and propensity matching procedures.
Wright Daniel B.
doaj +1 more source
Distance-regular Cayley graphs with small valency
, 2019 We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miklavič, Štefko, Milanič, Martin
openaire +1 more source
Graphs of Morphisms of Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both
Brown, R. +3 more
openaire +2 more sources
IEEE AccessFinancial transaction networks represent inter-firm relationships, where firms and transactions act as nodes and edges, respectively. Link prediction in these networks aims to identify potential future or missing transactions or links, providing valuable
Aparajita Bose, Byunghoon Kim
doaj +1 more source
Stochastic model for the process of Wine Award: Visualization and quantification [PDF]
Ciência e Técnica Vitivinícola, 2014 Sensory analysis is an important part of the process of evaluation of the quality of wines. Nowadays, one of the most used methods for describing this evaluation is the concept of awards.
González José A. +2 more
doaj +1 more source
On Almost Well-Covered Graphs of Girth at Least 6
, 2018 We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference ...
Ekim, Tınaz +3 more
core +1 more source