Results 101 to 110 of about 6,109 (206)
Discrete Applied Mathematics, 1987 It is shown that bipartite permutation graphs have good algorithmic properties in contrast to general bipartite or permutation graphs. Two characterizations of these graphs are presented which lead to a linear time recognition algorithm and also to polynomial algorithms for Hamiltonian problems, a variant of the crossing number problem and the minimum ...
Spinrad, Jeremy +2 more
openaire +1 more source
The use of different types of networks, alone and in combination, for drug target identification
British Journal of Pharmacology, Volume 183, Issue 8, Page 1653-1662, April 2026.Current therapeutic approaches often focus on targeting clinical symptoms or peripheral phenotypes rather than the underlying molecular mechanisms, or endophenotypes, that drive diseases. While symptom‐based drugs can alleviate discomfort, they do not necessarily alter disease progression and may overlook opportunities for prevention or early ...
Paolo Parini
wiley +1 more source
Social Inequality in Sight: Exploring Urban Visual Perception and Sentiment Across Income Levels
Transactions in GIS, Volume 30, Issue 2, April 2026.ABSTRACT Visual perception and sentimental expression are interconnected cognitive processes that shape environmental interaction, functioning at different levels across populations. Despite their inherent connection, prior studies have examined them in isolation, focusing on physical environments and overlooking diverse populations.
Ketong Shen, Jian Liu, Xintao Liu
wiley +1 more source
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs. [PDF]
Entropy (Basel), 2021 Sason I.
europepmc +1 more source
Degeneracies of Triangulated Graphs
Theory and Applications of GraphsA graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj +1 more source
Chromatic number and regular subgraphs
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer +2 more
wiley +1 more source
Fusion of KATZ measure and space projection to fast probe potential lncRNA-disease associations in bipartite graphs. [PDF]
PLoS One, 2021 Zhang Y +7 more
europepmc +1 more source
Advanced Science, Volume 13, Issue 16, 18 March 2026.SAGE is a unified framework for spatial domain identification in spatial transcriptomics that jointly models tissue architecture and gene programs. Topic‐driven gene selection (NMF plus classifier‐based scoring) highlights spatially informative genes, while dual‐view graph embedding fuses local expression and non‐local functional relations.
Yi He +5 more
wiley +1 more source
Perceived Saturation in Normal and Red–Green Color‐Deficient Observers
Color Research &Application, Volume 51, Issue 2, March/April 2026.Results in this study indicate that perceived saturation of protan (P) and deutan (D) observers is lower than that of color normal (N) observers as shown in the figures. Horizontal axis denotes the stimulus pair with the same hue but different chroma.
Miyoshi Ayama +2 more
wiley +1 more source
Concurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira +4 more
wiley +1 more source