Results 81 to 90 of about 137 (126)

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

An Asymptotically Optimal Minimum Degree Ordering of Regular Grids

, 1995
It has previously been shown that there exists a minimum degree ordering for regular grids that is considerably worse than nested dissection in terms of fill-in and operations for factorization [1].
Kumar Sadayappan, C. -h. Huang, B. Kumar
core  

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

Derandomized Graph Products

, 1995
. Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to 1 to approximating clique within a factor of n ffl (for some ffl). This reduction was further studied by Blum, who gave
Avi Wigderson, Noga Alon, Uriel Feige, David Zuckerman   +3 more
core  

Optimal Total Exchange in Cayley Graphs

, 1996
Consider an interconnection network and the following situation: every node needs to send a different message to every other node. This is the total exchange problem, one of a number of information dissemination problems known as collective ...
Nikitas J. Dimopoulos, Vassilios V. Dimakopoulos   +1 more
core  

Load balancing for integer loads using a modified approach

Array
Load balancing plays a crucial role in improving the performance of distributed systems, where uneven task distribution often leads to poor resource utilisation and degraded system throughput.
Saumya Y.M., S.M. Hegde
doaj   +1 more source

Spectral Nested Dissection

, 1992
. We describe a spectral nested dissection algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to ...
Lie Wang, Alex Pothen, Horst D. Simon
core  

A novel algebraic technique for adjacency matrices of some derived graphs

Mathematical and Computer Modelling of Dynamical Systems
Graph 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, Aysun Yurttas Gunes, Sadik Delen, Medha Itagi Huilgol, Berke Ozmen, Ismail Naci Cangul   +5 more
doaj   +1 more source

Stack And Queue Layouts Of Posets

, 1995
. The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and ...
Lenwood S. Heath, Sriram V. Pemmaraju, Sriram   +2 more
core  

A New Parallel Chasing Algorithm For Transforming Arrowhead Matrices To Tridiagonal Form

, 1998
. Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical approach, we propose a new chasing algorithm.
Suely Oliveira
core