Results 181 to 190 of about 617,805 (269)

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Robust Target Association Method with Weighted Bipartite Graph Optimal Matching in Multi-Sensor Fusion. [PDF]

Sensors (Basel)
Wu H, Chen W, Chen W.
europepmc   +1 more source

Robustness of the Sauer–Spencer Theorem

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Mihir Neve   +3 more
wiley   +1 more source

BiGvCL: bipartite graph-based cross-domain contrastive learning model for the predicting drug-gene interactions. [PDF]

Brief Bioinform
He S, Wang Z, Li J, Zou Q, Zhang F.
europepmc   +1 more source

Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]

We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.), Israeli, Amos, Rytter, Wojciech   +2 more
core  

On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek   +2 more
wiley   +1 more source

Long-term care plan recommendation for older adults with disabilities: a bipartite graph transformer and self-supervised approach. [PDF]

J Am Med Inform Assoc
Miao C, Luo J, Liang Y, Liang H, Cen Y, Guo S, Yu H.   +6 more
europepmc   +1 more source

Ethnic integration and the value of innovation

Strategic Management Journal, Volume 47, Issue 10, Page 2792-2820, October 2026.
Abstract Research Summary Organizations have become increasingly ethnically diverse, and this diversity often brings together distinct technological competencies. Understanding how firms can leverage such diversity to produce valuable innovations therefore becomes essential.
Stefano Breschi, Luisa Gagliardi, Thomas Yoon   +2 more
wiley   +1 more source

Maize yield prediction with trait-missing data via bipartite graph neural network. [PDF]

Front Plant Sci
Wang K, Han Y, Zhang Y, Zhang Y, Wang S, Yang F, Liu C, Zhang D, Lu T, Zhang L, Liu Z.   +10 more
europepmc   +1 more source

A method for building a genome-connectome bipartite graph model. [PDF]

J Neurosci Methods, 2019
Yu Q, Chen J, Du Y, Sui J, Damaraju E, Turner JA, van Erp TGM, Macciardi F, Belger A, Ford JM, McEwen S, Mathalon DH, Mueller BA, Preda A, Vaidya J, Pearlson GD, Calhoun VD.   +16 more
europepmc   +1 more source