Results 191 to 200 of about 27,298 (312)

DualKG-DC: A Drug-Centric Dual-Layer Knowledge Graph Framework for Drug Combination Prediction. [PDF]

J Med Syst
Gao Z, Perkins SW, Parameswaran S, Xu R.
europepmc   +1 more source

Long Induced Paths in K s , s‐Free Graphs

Journal of Graph Theory, Volume 112, Issue 4, Page 438-441, August 2026.
ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s‐free graph containing an n‐vertex path must contain an induced path of length f ( n ), where f ( n ) → ∞ as n → ∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 / 5 − o ( 1 ).
Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon   +3 more
wiley   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.
ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley   +1 more source

Note on extremal problems about connected subgraph sums. [PDF]

Graphs Comb
Cambie S, Groenland C.
europepmc   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

Hunting Structural Demons in Digital Reticular Chemistry: Lessons From Metal‐Organic Frameworks

Israel Journal of Chemistry, Volume 66, Issue 4, July 2026.
Digital reticular chemistry is haunted by “structural demons”, chemically invalid models lurking within massive experimental and hypothetical MOF databases. This mini‐review tracks where these anomalies enter the data pipeline, evaluate the modern computational arsenal used to detect them (from rule‐based algorithms to machine‐learning classifiers ...
Yongchul G. Chung, Myoung Soo Lah
wiley   +1 more source

TRACE-DDI: A Hybrid Framework of Transformer-GAT Context Encoder and Pathway-Anchored Knowledge Graphs for DDI Prediction. [PDF]

Comput Struct Biotechnol J
Kim J, Seo T, Jo K.
europepmc   +1 more source

Geographic Patterns in I2P Peer Selection: An Empirical Network Topology Analysis

Internet Technology Letters, Volume 9, Issue 4, July/August 2026.
ABSTRACT The Invisible Internet Project (I2P) routes data via encrypted, decentralized tunnels. Peer selection can significantly affect security and performance. This empirical study examines whether geographic location systematically influences I2P's routing topology.
Siddique Abubakr Muntaka, Jess Kropczynski, Jacques Bou Abdo, Murat Ozer   +3 more
wiley   +1 more source

ETX2Vec: a fraud detection algorithm for ethereum based on temporal biased random walk strategy. [PDF]

Sci Rep
Lu J, Liao B, Liu Y, Zhong L.
europepmc   +1 more source

R ( 5 , 5 ) ≤ 46

Journal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source