Results 11 to 20 of about 94 (94)

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

Promises and limitations of deep learning for predicting knee osteoarthritis progression from medical imaging: A systematic review

Knee Surgery, Sports Traumatology, Arthroscopy, EarlyView.
Abstract Purpose To systematically evaluate the performance, methodological quality, and translational barriers of deep learning (DL) models for predicting knee osteoarthritis (KOA) progression from medical imaging. Methods Following PRISMA guidelines, we searched PubMed, Scopus, and Web of Science (inception to June 2026) for peer‐reviewed studies ...
Amna Gillani, Rüdiger von Eisenhart‐Rothe, Klaus Woertler, Michael T. Hirschmann, Daniel Rueckert, Florian Hinterwimmer   +5 more
wiley   +1 more source

Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks

Networks, EarlyView.
ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar, Gang Zhang   +3 more
wiley   +1 more source

H2CD: Semantic‐Enhanced Heterogeneous Hypergraph Network With Large Language Model for Cognitive Diagnosis

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Cognitive diagnosis aims to infer learners' knowledge states from their exercise responses, enabling personalised education at scale. Existing methods represent exercises solely by coarse‐grained knowledge component annotations, overlooking semantic content and step‐level cognitive processes.
Youheng Bai, Zitao Liu, Mingliang Hou, Teng Guo, Weiqi Luo   +4 more
wiley   +1 more source

Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

Computer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci, Annika Bonerath, Walter Didimo, Henry Förster, Seok‐Hee Hong, Maria Eleni Pavlidi, Alessandra Tappini   +6 more
wiley   +1 more source

CAnDE: Entity‐Based Relationship Exploration Using a Cards and Decks Metaphor

Computer Graphics Forum, EarlyView.
We present CAnDE, a visual analytics approach for exploring dynamically defined entities in digital criminal data. Inspired by evidence boards, CAnDE uses a cards and decks metaphor that maps complex concepts to familiar interactions, including rotating, flipping and stacking cards.
K. A. Roggenbuck, A. Vilanova, S. van den Elzen   +2 more
wiley   +1 more source

Rates of Evolution Differ Between Cell Types Identified by Single‐Cell RNAseq in Threespine Stickleback

Molecular Ecology, Volume 35, Issue 19, October 2026.
ABSTRACT Rates of evolutionary change vary by gene. While some broad gene categories are highly conserved with little divergence over time, others undergo continuous selection pressure and are highly divergent among populations or species. But such comparative evolutionary studies rely on gene ontology categories that are rarely validated in the study ...
Maria L. Rodgers, Swapna Subramanian, Lauren E. Fuess, Wan He, Samuel V. Scarpino, Andrea J. Roth‐Monzón, Daniel L. Jeffries, Martine Seignon, Kathryn Milligan‐McClellan, Rebecca Carrier, Natalie C. Steinel, Daniel I. Bolnick   +11 more
wiley   +1 more source

Bounded diameter monochromatic component covers

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley   +1 more source

Multimodal University Academic Performance Prediction Model Based on Heterogeneous Graph Neural Networks

Engineering Reports, Volume 8, Issue 9, September 2026.
The HGN‐MSP model addresses academic performance prediction challenges through multimodal graph learning with semantic alignment and modality balancing, achieving 0.896 AUC and 5.3% improvement over XGBoost in precisely identifying at‐risk students on a dataset of 19,856 students.
Jun Fan, Bin Chen, Byungwon Min, Tao Xie
wiley   +1 more source