Results 121 to 130 of about 2,876,957 (249)
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
How to optimise tournament draws: The case of the FIFA World Cup
International Transactions in Operational Research, EarlyView.Abstract The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade‐off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform ...
László Csató
wiley +1 more source
Complexity of Join and Corona graphs and Chebyshev polynomials
Journal of Taibah University for Science, 2018 Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
Obesity Reviews, EarlyView.ABSTRACT Bariatric surgery (BS) has short‐ and medium‐term benefits in improving metabolic syndrome (MetS) components, but its long‐term impact remains incompletely characterized. This systematic review and meta‐analysis aimed to quantify the long‐term effects of BS (≥ 5 years) on fasting blood glucose (FBG), HDL cholesterol, triglycerides (TG), waist ...
Bernardo Paz Barboza +7 more
wiley +1 more source
The Linear and Cyclic Cutwidth of the Complete Bipartite Graph
, 2003 We shall consider the problem of embedding the complete bipartite graph, Km,n, onto a linear and cyclic chassis in such a way as to minimize the cutwidth.
Matt Johnson
core
Unavoidable patterns in $2$-colorings of the complete bipartite graph [PDF]
We determine the colored patterns that appear in any $2$-edge coloring of $K_{n,n}$, with $n$ large enough and with sufficient edges in each color. We prove the existence of a positive integer $z_2$ such that any $2$-edge coloring of $K_{n,n}$ with at ...
Hansberg, Adriana, Ventura, Denae
core +1 more source
Modular irregularity strength of dense graphs
Electronic Journal of Graph Theory and ApplicationsWe solve the open problem posed in Modular irregularity strength of graphs, Electron. J. Graph Theory and Appl. 8 (2020), 435–433, asking about the modular irregularity strength of the complete graph Kn for all n ≥ 3.
I Nengah Suparta +3 more
doaj +1 more source
Zoologica Scripta, EarlyView.ABSTRACT This systematic review documented a taxonomically diverse parasite fauna of freshwater fishes across seven geographical regions of Türkiye, encompassing 11 phyla: Acanthocephala, Annelida, Arthropoda, Choanozoa, Ciliophora, Cnidaria, Euglenozoa, Mollusca, Myzozoa, Nematoda, and Platyhelminthes.
Canan Hamurkaroğlu +3 more
wiley +1 more source
Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, Volume 113, Issue 4, Page 634-649, December 2026.ABSTRACT Let n , k be positive integers such that n ≥ k and G be a tripartite graph with parts A , B , C such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n. Denote the edge densities of G [ A , B ] , G [ A , C ] and G [ B , C ] by α , β and γ, respectively. In this paper, we study edge density conditions for the existence of k vertex‐disjoint triangles in a ...
Mingyang Guo, Klas Markström
wiley +1 more source
Impact of Self-Loops on the Determinant of Graphs
Journal of MathematicsThe current theoretical study intends to analyze the determinant of a certain class of graphs with self-loops. This study focuses on a vast unexplored area of adjacency matrices with nonzero diagonal entities.
Deekshitha V. A. +3 more
doaj +1 more source