Results 11 to 20 of about 30,996 (263)
Local Fractional Metric Dimensions of Generalized Petersen Networks
IEEE Access, 2021 Metric dimension is a distance-based tool that is used in the different fields of computer science and chemistry such as navigation, combinatorial optimization, pattern recognition, image processing, integer programming and formation of chemical ...
Mohsin Raza +2 more
doaj +1 more source
Local Fractional Metric Dimensions of Rotationally Symmetric and Planar Networks
IEEE Access, 2020 Mathematical modeling, coding or labeling with the help of numeric numbers based on the parameter of distance plays a vital role in the studies of the structural properties of the networks such as accessibility, centrality, clustering, complexity ...
Jia-Bao Liu +2 more
doaj +1 more source
Local Fractional Strong Metric Dimension of Certain Complex Networks
Complexity, 2023 Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems.
Faiza Jamil +3 more
doaj +1 more source
Journal of Mathematics, 2021 The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability.
Shahbaz Ali +3 more
doaj +1 more source
Novel Architecture for Efficient Implementation of Modular Exponentiation Algorithm [PDF]
International Journal of Web ResearchOne of the most difficult problems in web research is security. Cryptography is the fundamental technique utilized in secure communication. One key element of cryptography is Public-Key Cryptography (PKC).
Abdalhossein Rezai
doaj +1 more source
Computational complexity and an integer programming model of Shakashaka [PDF]
, 2013 Shakashaka, one of the so-called “pencil-and-paper”puzzles like Sudoku, was proposed by Guten and hasbeen popularized by the Japanese publisher Nikoli. The computational complexity of Shakashaka was not studied so far.
Uehara, Ryuhei +3 more
core +1 more source
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
A generalisation of two partition theorems of Andrews [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur’s celebrated partition identity (1926). Andrews’ two generalisations of Schur’s theorem went on to become two of the most influential results in ...
Jehanne Dousse
doaj +1 more source
Fully Homomorphic Encryption Scheme for Securing Cloud Data
UHD Journal of Science and Technology, 2023 One of the pioneer and important fields in the computer science area is cloud computing. The data within cloud computing are usually transformed to it from local storage; therefore, the security of this data is an important issue.
Tara Al Attar, Mohammed Anwar MOHAMMED
doaj +1 more source
Integer polyhedra for program analysis [PDF]
, 2009 Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the ...
Howe, J. M. +8 more
core +1 more source