Results 41 to 50 of about 139 (132)
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +1 more source
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
Journal of Algebra, 2011 20 pages; v2 contains relatively minor changes in presentation and updated references.
Francisco, Christopher A. +2 more
openaire +3 more sources
Discrete Mathematics, 1992 The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
Miroslaw Truszczynski, Zsolt Tuza
openaire +2 more sources
On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs
The International Arab Journal of Information Technology, 2019 A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. The hypergraph 2- Coloring Problem is the question whether a given hypergraph is 2-colorable. It is known that deciding the 2-colorability of hypergraphs is NP-complete even for hypergraphs whose hyperedges have size at most 3.
openaire +1 more source
ASPECTS OF TOPOLOGICAL APPROACHES FOR DATA SCIENCE. [PDF]
Found Data Sci, 2022 Grbić J, Wu J, Xia K, Wei GW.
europepmc +1 more source
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey [PDF]
, 2006 The current situation with bounds on the smallest number of edges in color-critical graphs and hypergraphs is discussed.
openaire +1 more source
What makes a reaction network "chemical"? [PDF]
J Cheminform, 2022 Müller S, Flamm C, Stadler PF.
europepmc +1 more source
A study of cluster hypergraphs and its properties. [PDF]
Soc Netw Anal Min, 2021 Maity A +4 more
europepmc +1 more source
Coloring geometric hyper-graph defined by an arrangement of half-planes [PDF]
, 2010 We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
openaire +2 more sources