Results 121 to 130 of about 8,970,965 (255)
A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems
ABSTRACT Routing problems such as the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP) are computationally challenging due to the exponential growth of their feasible solution spaces with increasing instance size.
Johannes Gückel +2 more
wiley +1 more source
Complexity Results on Graphs with Few Cliques
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection ...
Bill Rosgen, Lorna Stewart
doaj
Integral sum graphs Gn and G-r,n are perfect graphs
A graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham +4 more
doaj +1 more source
Traditional Chinese Medicine has expanded far beyond Asia, with growing markets in North America and Europe for supplements and functional foods. Lingzhi or Reishi (Ganoderma lingzhi), a well‐known medicinal mushroom, is valued for its anti‐inflammatory and anticancer properties.
Torda Varga +8 more
wiley +1 more source
PTA alleviates atherosclerosis by regulating the MDM2/GPX4 axis‐mediated endothelial ferroptosis. ABSTRACT Endothelial ferroptosis is a crucial pathogenic driver of atherosclerosis (AS) progression. Protosappanin A (PTA), a bioactive compound from Caesalpinia sappan L., protects cardiovascular vessels by regulating ferroptosis.
Jiamei Fu +6 more
wiley +1 more source
ABSTRACT European urban climate change research lacks integration across scales, geography, and climate challenges, despite Europe's coordinated policy frameworks. Through a hybrid bibliometric and systematic review of 1528 studies (2010–2025) using Cortext Manager and PRISMA 2020 guidelines, this study maps the conceptual patterns, knowledge gaps, and
Isabela Pichardo‐Velázquez +2 more
wiley +1 more source
Computing the clique number of tournaments
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any integer $k \geq
Aubian, Guillaume
core
T T Te e ec c ch h hn n ni i ic c ca a al l l R R Re e ep p po o or r rt t t A note on the complexity of the maximum edge clique partitioning problem with respect to clique number Abstract The maximum edge clique partitioning problem (Max-ECP) was ...
Atsushi Miyauchi, Noriyoshi Sukegawa
core
ABSTRACT Active consumer participation is widely regarded as a key enabler of the energy transition, with emerging digital technologies creating new opportunities for engagement. However, these technologies only contribute to sustainable development if they are perceived as beneficial by diverse consumer groups.
Theresa Magdalena Sophie Heinrich +4 more
wiley +1 more source
PPEPV‐RDL: Achieving Privacy‐Preserving, Efficient, Publicly Verifiable Rational Delegation Learning
ABSTRACT Delegation learning is an implementation approach within privacy‐preserving machine learning (PPML). It refers to that the delegator outsources the training task to servers with strong computing power due to its own limited computing resources, and the servers return the correct training results and get the service revenue.
Xinyu Zhang +4 more
wiley +1 more source

