Results 61 to 70 of about 116 (110)
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
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
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
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
Modeling calcium dynamics in neurons with endoplasmic reticulum: existence, uniqueness and an implicit-explicit finite element scheme. [PDF]
Commun Nonlinear Sci Numer Simul, 2022 Guan Q, Queisser G.
europepmc +1 more source
Inserting One Edge into a Simple Drawing is Hard. [PDF]
Discrete Comput Geom, 2023 Arroyo A +5 more
europepmc +1 more source
A novel algebraic technique for adjacency matrices of some derived graphs
Mathematical and Computer Modelling of Dynamical SystemsGraph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna +5 more
doaj +1 more source