Results 41 to 50 of about 1,956 (175)

Link Prediction Based on Simple Path Graphs [PDF]

Jisuanji gongcheng
Link prediction is an important task in graph machine learning that aims to recover missing edges in graphs or predict potential future connections between nodes.
LI Zhiren, ZHENG Weiguo
doaj   +1 more source

A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation

Entropy, 2023
In order to implement a quantum circuit on an NISQ device, it must be transformed into a functionally equivalent circuit that satisfies the device’s connectivity constraints.
Yang Qian, Zhijin Guan, Shenggen Zheng, Shiguang Feng   +3 more
doaj   +1 more source

Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang, Hongxu Chen, Xiangyu Zhao, Sixiao Zhang, Xiangguo Sun, Qian Li, Hongzhi Yin, Guandong Xu   +7 more
wiley   +1 more source

Pairwise Imitation and Tournament Graphs

International Economic Review, EarlyView.
ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang, Philip R. Neary, Jonathan Newton, Ryoji Sawa   +3 more
wiley   +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

Subgraph isomorphism on graph classes that exclude a substructure [PDF]

, 2019
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either ...
van der Zanden, Tom C., van der Zanden, Tom, Hans L. Bodlaender, Bodlaender, H.L., Kobayashi, Yasuaki, Hanaka, T, Yoshio Okamoto, Hanaka, Tesshu, Yota Otachi, Heggernes, Pinar, Otachi, Yota, Tesshu Hanaka, Kobayashi, Yusuke, Bodlaender, Hans L., Okamoto, Yoshio, Sub Algorithms and Complexity, Zanden, TC van der, Tom C. van der Zanden, Zanden, Tom C. van der, Bodlaender, HL Hans, Algorithms and Complexity   +20 more
core   +2 more sources

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Journal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák, Félix Moreno Peñarrubia   +1 more
wiley   +1 more source

Low-Power Subgraph Isomorphism at the Edge Using FPGAs

IEEE Access
Subgraph matching is a significant problem in several fields, including like social network analysis, chemical compound search, and fraud detection. While current solutions using CPU, graphics processing units (GPUs), and data center field-programmable ...
Roberto Bosio, Giovanni Brignone, Teodoro Urso, Mihai T. Lazarescu, Luciano Lavagno, Paolo Pasini   +5 more
doaj   +1 more source

Fractional Q-Edge-Coloring of Graphs

Discussiones Mathematicae Graph Theory, 2013
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj   +1 more source

On QSAR-based cardiotoxicity modeling with the expressiveness-enhanced graph learning model and dual-threshold scheme

Frontiers in Physiology, 2023
Introduction: Given the direct association with malignant ventricular arrhythmias, cardiotoxicity is a major concern in drug design. In the past decades, computational models based on the quantitative structure–activity relationship have been proposed to
Huijia Wang, Guangxian Zhu, Leighton T. Izu, Ye Chen-Izu, Naoaki Ono, MD Altaf-Ul-Amin, Shigehiko Kanaya, Ming Huang   +7 more
doaj   +1 more source