Results 201 to 210 of about 8,313 (308)

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, Volume 87, Issue 4, Page 404-427, June 2026.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz   +2 more
wiley   +1 more source

A Resource Efficient Ising Model‐Based Quantum Sudoku Solver

open access: yesSoftware: Practice and Experience, Volume 56, Issue 6, Page 643-657, June 2026.
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang   +5 more
wiley   +1 more source

Text Mining in Bibliometrics and Science Mapping: A Methodological Review

open access: yesWIREs Computational Statistics, Volume 18, Issue 2, June 2026.
Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content‐sensitive
Michelangelo Misuraca
wiley   +1 more source

Exploring the Potential of Calebin‐A in Targeting Obesity‐Related Genes and Pathways

open access: yesJournal of Cellular and Molecular Medicine, Volume 30, Issue 11, June 2026.
ABSTRACT Obesity is a global health crisis affecting millions, associated with metabolic disorders such as type 2 diabetes and cardiovascular disease. Calebin‐A, a bioactive compound derived from Curcuma species, has shown promise in managing obesity and its complications.
Ali Mahmoudi   +4 more
wiley   +1 more source

Subgraph entropy

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.
Abstract Given r⩾3$r \geqslant 3$, we prove that there exists λ>0$\lambda >0$ depending only on r$r$ so that if G$G$ is a metric graph of rank r$r$ with metric entropy 1, then there exists a proper subgraph H$H$ of G$G$ with metric entropy at least λ$\lambda$. This answers a question of the second two authors together with Rieck. We interpret this as a
Tawfiq Hamed, Tarik Aougab, Matt Clay
wiley   +1 more source

Home - About - Disclaimer - Privacy