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.

E.R. Lamken1, S.A. Vanstone2
1 School of Mathematics Georgia Institute of Technology Atlanta, GA 30332
2Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada N2L 3G1
Abstract:

In this paper, we investigate the existence of skew frames with sets of skew transversals. We consider skew frames of type \(1^n\) and skew frames of type \((2^m)^q\) with sets of skew transversals. These frames are equivalent to three-dimensional frames which have complementary \(2\)-dimensional projections with special properties.

Charles J.Colbourn1, Rudolf A.Mathon2
1 Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 CANADA
2Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1Al1 CANADA
Abstract:

All graphs meeting the basic necessary conditions to be the leave graph of a maximal partial triple system with at most thirteen elements are generated. A hill-climbing algorithm is developed to determine which of these candidates are in fact leave graphs. Improved necessary conditions for a graph to be a leave graph are developed.

Geoffrey Exoo1
1Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809
Abstract:

Some new lower bounds for higher Ramsey numbers are presented. Results concerning generalized hypergraph Ramsey numbers are also given.

W.D. Wallis1, Wang Zhi-jian2
1Southern Illinois University, Carbondale IL 62901 Scochow Railway Teachers College, Scochow, People’s Republic of China
2 Southern Illinois University, Carbondale IL 62901 Scochow Railway Teachers College, Scochow, People’s Republic of China
E.C. lhrig1, E. Seah1, D.R. Stinson1
1Arizona State University, University of Manitoba, and University of Manitoba
Abstract:

We enumerate the perfect one-factorizations of \(K_{50}\), which are generated by starters in \({Z}_{49}\), fixed by multiplication by \(18\) and \(30\). There are precisely \(67\) non-isomorphic examples.

RG. Stanton1, Anne Penfold Street2
1Department of Computer Science University of Manitoba Winnipeg, Canada R3T 2N2
2Department of Mathematics Department of Mathematics St. Lucia, Queensland, Australia 4067
Edward T.Ordman1
1Department of Mathematical Sciences Menphis State University Memphis, TN 38152
Abstract:

Let the vertices of a graph denote computer processes which communicate by passing messages along edges. It has been a standard Computer Science problem to provide algorithms that let the processes solve problems jointly (e.g. leader election, clock synchronization). What if some of the processes are maliciously faulty, i.e. send messages calculated to sabotage joint algorithms? Here we review a few “byzantine agreement” algorithms with interesting graph-theoretic features and raise questions about graph connectivity and diameter (with a few answers).

Edward T.Ordman1
1Department of Mathematical Sciences Memphis State University Memphis, TN 38152
Abstract:

Let the vertices of a graph denote processes in a distributed or time-shared computer system; let two vertices be connected by an edge if the two processes cannot proceed at the same time (they mutually exclude one another). Managing mutual exclusion and related scheduling problems has given rise to substantial literature in computer science. Some methods of attack include covering or partitioning the graph with cliques or threshold graphs. Here I survey some recent graph-theoretic results and examples motivated by this approach.

Edward Neuman1
1Department of Mathematics Southern Illinois Univereity Carbondale, Illinois 62901

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;