Results 71 to 80 of about 889 (120)
Finite-dimensional Zinbiel algebras and combinatorial structures
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source
Complex of abstract cubes and median problem [PDF]
Computer Science Journal of Moldova, 2011 In this paper a special complex $\mathcal{K}^{n}$ of abstract cubes [2, 3], which contains only $n$-dimensional cubes is examined. The border of this complex is an abstract $(n-1)$-dimensional sphere.
Sergiu Cataranciuc, Petru Soltan
doaj
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj +1 more source
Eccentricity of Networks with Structural Constraints
Discussiones Mathematicae Graph Theory, 2020 The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž +3 more
doaj +1 more source
Measuring Generalized Preferential Attachment in Dynamic Social Networks
, 2005 The mechanism of preferential attachment underpins most recent social network formation models. Yet few authors attempt to check or quantify assumptions on this mechanism.
Roth, Camille
core +4 more sources
Quartet consistency count method for reconstructing phylogenetic trees
, 2006 Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie ...
Cho, Jin-Hwan +2 more
core
A $4/3$ Approximation for $2$-Vertex-Connectivity [PDF]
TheoretiCSThe 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph $G$.
Miguel Bosch-Calvo +2 more
doaj +1 more source
Caterpillars Have Antimagic Orientations
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +1 more source
ORTHOGONAL TRACE-SUM MAXIMIZATION: TIGHTNESS OF THE SEMIDEFINITE RELAXATION AND GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS. [PDF]
SIAM J Optim, 2022 Won JH, Zhang T, Zhou H.
europepmc +1 more source
Revisiting structure graphs: Applications to CBC-MAC and EMAC
Journal of Mathematical Cryptology, 2016 In [2], Bellare, Pietrzak and Rogaway proved an O(ℓq2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj +1 more source