Utilitas Algorithmica (UA)
ISSN: xxxx-xxxx (print)
Utilitas Algorithmica (UA) is a premier, open-access international journal dedicated to advancing algorithmic research and its applications. Launched to drive innovation in computer science, UA publishes high-impact theoretical and experimental papers addressing real-world computational challenges. The journal underscores the vital role of efficient algorithm design in navigating the growing complexity of modern applications. Spanning domains such as parallel computing, computational geometry, artificial intelligence, and data structures, UA is a leading venue for groundbreaking algorithmic studies.
- Research article
- https://doi.org/10.61091/um121-06
- Full Text
- Utilitas Mathematica
- Volume 121
- Pages: 69-90
- Published: 31/12/2024
We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\)-labeling of \(G\) if every two distinct vertices have distinct weights, where the weight of a vertex \(x\) is defined as the sum of labels of vertices whose distance from \(x\) belongs to \(D\). The least integer \(k\) for which \(G\) admits a \(D\)-irregular labeling is the \(D\)-irregularity strength of \(G\) and denoted by \(\mathrm{s}_D(G)\). In this paper, we establish several fundamental properties on \(D\)-irregularity strength for arbitrary graphs. We also determine this parameter exactly for families of graphs with small diameter or small maximum degree.
- Research article
- https://doi.org/10.61091/ars161-06
- Full Text
- Ars Combinatoria
- Volume 161
- Pages: 75-87
- Published: 31/12/2024
Let \( 0<k\in\mathbb{Z} \). Let the star 2-set transposition graph \( ST^2_k \) be the \( (2k-1) \)-regular graph whose vertices are the \( 2k \)-strings on \( k \) symbols, each symbol repeated twice, with its edges given each by the transposition of the initial entry of one such \( 2k \)-string with any entry that contains a different symbol than that of the initial entry. The pancake 2-set transposition graph \( PC^2_k \) has the same vertex set of \( ST^2_k \) and its edges involving each the maximal product of concentric disjoint transpositions in any prefix of an endvertex string, including the external transposition being that of an edge of \( ST^2_k \). For \( 1<k\in\mathbb{Z} \), we show that \( ST^2_k \) and \( PC^2_k \), among other intermediate transposition graphs, have total colorings via \( 2k-1 \) colors. They, in turn, yield efficient dominating sets, or E-sets, of the vertex sets of \( ST^2_k \) and \( PC^2_k \), and partitions into \( 2k-1 \) such E-sets, generalizing Dejter-Serra work on E-sets in such graphs.
- Research article
- https://doi.org/10.61091/jcmcc123-06
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 123
- Pages: 75-85
- Published: 31/12/2024
The scientific knowledge graph is an emerging research method in this context. In the research of physical education teaching, the research and sorting out of the research results of physical education teaching in my country from the perspective of scientometrics and information visualization is still slightly insufficient. The similarity between the frontiers of physical education teaching research in China and the United States in the past five years is that both countries have paid more attention to research topics such as physical education teaching methods and physical education courses. This paper proposes a rough set knowledge reduction algorithm based on improved genetic algorithm. The support and importance of conditional attributes to decision attributes are introduced into the information system, which are added to the genetic algorithm as heuristic information, and the concepts of population dissimilarity and individual dissimilarity are proposed to improve the genetic algorithm. The research on school physical education in my country is biased towards problem research, while the research on physical education teaching methods in the United States is biased towards student health; In addition, starting from the national conditions, the hotspots in the field of physical education teaching in my country tend to be “Sports and Health Curriculum Standards”, physical education teachers, physical education ideas, educational theories and college sports, while the hotspots in the field of physical education teaching in the United States tend to be physical activity, children and adolescents , students, women, exercise education, physical education, self-determination theory, and the integration of psychological motivation and physical education. Experimental data analysis my country’s physical education curriculum research should appropriately increase the attention to the details of physical education curriculum, and my country’s physical education teaching practice research should appropriately increase the research on physical education from the perspective of public health.
- Research article
- https://doi.org/10.61091/jcmcc123-05
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 123
- Pages: 61-73
- Published: 31/12/2024
In secret sharing, the relationships between participants and the information they hold can be modeled effectively using graph structures. Graphs allow us to visualize and analyze these relationships, making it easier to define access structures, optimize share distributions, and ensure security. This paper provides the first comprehensive review of existing research on the application of graph theory to secret sharing comparing different classic and modern approaches and analyzing the current litterature. Through this study we highlight the key advances and methodologies that have been developed, underscoring the pivotal role of graph theoretic approaches in enhancing the security and efficiency of secret sharing schemes. Furthermore, the review identifies open challenges and future research directions, providing insights into potential innovations that could further strengthen cryptographic practices. This work serves as a foundational resource for researchers and practitioners seeking to deepen their understanding of the intersection between graph theory and secret sharing, fostering the development of more robust and sophisticated cryptographic solutions.
- Research article
- https://doi.org/10.61091/um121-05
- Full Text
- Utilitas Mathematica
- Volume 121
- Pages: 53-68
- Published: 31/12/2024
A proper coloring assigns distinct colors to the adjacent vertices of a graph. An equitable near proper coloring of a graph \(G\) is an improper coloring in which neighbouring vertices are allowed to receive the same color such that the cardinalities of two distinct color classes differ by not more than one and the number of monochromatic edges is minimised by giving certain restrictions on the number of color classes that can have an edge between them. This paper discusses the equitable near proper coloring of line, middle, and total graphs of certain graph classes, such as paths, cycles, sunlet graphs, star graphs, and gear graphs.
- Research article
- https://doi.org/10.61091/ars161-05
- Full Text
- Ars Combinatoria
- Volume 161
- Pages: 61-73
- Published: 31/12/2024
This paper investigates the Turan-like problem for \(\mathcal{K}^-_{r + 1}\)-free \((r \geq 2)\) unbalanced signed graphs, where \(\mathcal{K}^-_{r + 1}\) is the set of unbalanced signed complete graphs with \(r+1\) vertices. The maximum number of edges and the maximum index for \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs are given. Moreover, the extremal \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs with the maximum index are characterized.
- Research article
- https://doi.org/10.61091/um121-04
- Full Text
- Utilitas Mathematica
- Volume 121
- Pages: 37-52
- Published: 31/12/2024
Directed hypergraphs represent a natural extension of directed graphs, while soft set theory provides a method for addressing vagueness and uncertainty. This paper introduces the notion of soft directed hypergraphs by integrating soft set principles into directed hypergraphs. Through parameterization, soft directed hypergraphs yield a sequence of relation descriptions derived from a directed hypergraph. Additionally, we present several operations for soft directed hypergraphs, including extended union, restricted union, extended intersection, and restricted intersection, and explore their characteristics.
- Research article
- https://doi.org/10.61091/ars161-04
- Full Text
- Ars Combinatoria
- Volume 161
- Pages: 49-59
- Published: 31/12/2024
In this paper, we give a classification of all Mengerian \(4\)-uniform hypergraphs derived from graphs.
- Research article
- https://doi.org/10.61091/jcmcc123-04
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 123
- Pages: 43-59
- Published: 31/12/2024
Big data technology makes it possible to scientifically analyse a large amount of marketing data, which plays an important role in the development of marketing strategies for products and the improvement of marketing effects. In this paper, a marketing data stream analysis system is designed based on the stream analysis method. The system designs and optimises the marketing data storage and retrieval, data acquisition and streaming calculation engine to achieve real-time user behaviour data streaming analysis. The average response time accuracy of the system’s data can reach 96%, the throughput rate is 11.8% ahead of the maximum compared to the Word Count system, and the before-and-after ratios of the PUSH message click rate, the user registration success rate, the online shop attention rate, the returning customer rate, and the loyal customer rate are 1.03, 1.02, 1.27, 1.11, 1.27, and 1.78, respectively. It indicates that this paper’s design of the marketing data streaming analysis system has good performance and application effect.
- Research article
- https://doi.org/10.61091/jcmcc123-03
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 123
- Pages: 33-41
- Published: 31/12/2024
With the construction of the national discourse power, the international communication of German language has also attracted the attention of the public, and its own communication attributes and characteristics have also become a hot topic around the world. A machine learning development process includes operations such as data preprocessing, feature engineering, model design, and super parameter optimization. Changes in the configuration of each operation may affect the final quality of the model. Nor is it mainly the problem of teachers’ teaching, but the communication barrier caused by cultural differences. We can see that there are still many obstacles and misunderstandings in language, thought, cross-cultural communication and knowledge in many communication occasions between China and Germany. Through reviewing and summarizing the previous studies on intercultural communication, this paper analyzes the current situation of intercultural communication studies, points out the problems existing in the current research, and tries to put forward the cultivation methods of intercultural communication.




