Theoretical Computer Science and Discrete Mathematics

Edited by
February 2022
257 pages
  • ISBN978-3-0365-3177-9 (Hardback)
  • ISBN978-3-0365-3176-2 (PDF)

This book is a reprint of the Special Issue Theoretical Computer Science and Discrete Mathematics that was published in

Biology & Life Sciences
Chemistry & Materials Science
Computer Science & Mathematics
Physical Sciences

This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity.

  • Hardback
© 2022 by the authors; CC BY-NC-ND license
fuzzy set; n-Pythagorean; n-PFS algebra; triangular norms; outer-independent Roman domination; Roman domination; vertex cover; rooted product graph; total domination; domination; rooted product graph; secure domination; secure Italian domination; weak roman domination; w-domination; cryptanalysis; group key establishment; topology optimization; optimization; filtering; method; penalization; weight factor; FEM; MATLAB; SIMP; estimated prime factor; integer factorisation problem; continued fraction; Fermat’s Factoring Algorithm; genetic algorithm; cryptanalysis; AES(t); optimization; heuristics; microaggregation; statistical disclosure control; graph theory; traveling salesman problem; data privacy; location privacy; differentials in graphs; strong differential; quasi-total strong differential; quasi-total Italian domination number; numerical semigroup; forest; ordinarization transform; quasi-ordinarization transform; load redistribution; leveling power consumption per phase; three-phase asymmetric distribution networks; ideal power consumption; mixed-integer convex optimization; strongly total Roman domination; total Roman domination; total domination; lexicographic product graph; improved crow search algorithm; normal Gaussian distribution; phase swapping problem; power losses; asymmetric distribution grids; vortex search algorithm; nonidentical parallel production lines; axle housing machining; mixed model production; eligibility constraint; fuzzy due date; grey wolf optimizer; n/a