Results 201 to 210 of about 8,313 (308)
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
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
On characterizing game-perfect graphs by forbidden induced subgraphs
Stephan Dominique Andres
openalex +2 more sources
Induced subgraphs of graphs with large chromatic number. XI.\n Orientations [PDF]
Maria Chudnovsky +2 more
openalex +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
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
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
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams [PDF]
Jun Kawahara +3 more
openalex +1 more source
Exploring the Potential of Calebin‐A in Targeting Obesity‐Related Genes and Pathways
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
Maximum sparse induced subgraphs of the binomial random graph with given number of edges [PDF]
Dmitry Kamaldinov +2 more
openalex +1 more source
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
The Cops and Robber game on graphs with forbidden (induced) subgraphs
Gwenaël Joret +2 more
openalex +2 more sources

