Results 81 to 90 of about 719,735 (175)
Topological structures in computer science
, 1987 Topologies of finite spaces and spaces with countably many points are investigated. It is proven, using the theory of ordered topological spaces, that any topology in connected ordered spaces, with finitely many points or in spaces similar to the set ...
E. Khalimsky
semanticscholar +1 more source
Distance-Based Fractional Dimension of Certain Wheel Networks
Journal of MathematicsMetric dimension is one of the distance-based parameters which are used to find the position of the robot in a network space by utilizing lesser number of notes and minimum consumption of time. It is also used to characterize the chemical compounds.
Hassan Zafar +2 more
doaj +1 more source
Locating-dominating number of certain infinite families of convex polytopes with applications
HeliyonA convex hull of finitely many points in the Euclidean space Rd is known as a convex polytope. Graphically, they are planar graphs i.e. embeddable on R2. Minimum dominating sets possess diverse applications in computer science and engineering.
Sakander Hayat +3 more
doaj +1 more source
Metric Dimension Parameterized by Max Leaf Number
, 2015 The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in the input ...
Eppstein, David
core +1 more source
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
, 2007 Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programming ...
Bagnara, Roberto +2 more
core +5 more sources
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
Discrete Analysis, 2016 Hypercontractive inequalities via SOS, and the Frankl-Rödl graph, Discrete Analysis 2016:4, 20 pp. One of the major unsolved problems in theoretical computer science is the unique games conjecture of Subhash Khot. Its importance lies in the fact that it
Manuel Kauers +3 more
doaj +1 more source
Topology of quasi divisor graphs associated with non-associative algebra
Ain Shams Engineering JournalThe visualization of graphs representing algebraic structures has increasingly gained traction in chemical engineering research, emerging as a significant scientific challenge in contemporary studies.
Muhammad Nadeem +4 more
doaj +1 more source
Borel Ranks and Wadge Degrees of Context Free Omega Languages [PDF]
, 2006 We show that, from a topological point of view, considering the Borel and the Wadge hierarchies, 1-counter B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, for every non null
Finkel, Olivier
core +2 more sources
A security analysis of two classes of RSA-like cryptosystems
Journal of Mathematical CryptologyLet N=pqN=pq be the product of two balanced prime numbers pp and qq. In Elkamchouchi et al. (Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. In: ICCS 2002. vol. 1. IEEE Computer Society; 2002. p.
Cotan Paul, Teşeleanu George
doaj +1 more source
International Journal of Computational Intelligence SystemsThis paper presents a new methodology for solving multiple-attribute decision-making problems (MADMs) using a complex Pythagorean normal interval-valued fuzzy set (CPNIVFS), which is an extended concept of a complex Pythagorean fuzzy set.
Murugan Palanikumar +4 more
doaj +1 more source