Results 41 to 50 of about 1,396 (204)
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 +7 more
wiley +1 more source
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +1 more source
Defining Recursive Predicates in Graph Orders [PDF]
Logical Methods in Computer Science, 2018 We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary.
Ramanathan S. Thinniyam
doaj +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 +3 more
wiley +1 more source
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 +3 more
doaj +1 more source
Mission Aware Cyber‐Physical Security
Systems Engineering, Volume 29, Issue 2, Page 354-367, March 2026.ABSTRACT Perimeter cybersecurity, while essential, has proven insufficient against sophisticated, coordinated, and cyber‐physical attacks. In contrast, mission‐centric cybersecurity emphasizes finding evidence of attack impact on mission success, allowing for targeted resource allocation to mitigate vulnerabilities and protect critical assets.
Georgios Bakirtzis +3 more
wiley +1 more source
Link Prediction Based on Simple Path Graphs [PDF]
Jisuanji gongchengLink 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
WIREs Computational Molecular Science, Volume 16, Issue 2, March/April 2026.In this review, we present eMap 2.0, a web‐based platform for analyzing electron transfer pathways in proteins. We highlight representative applications of eMap, including its use in characterizing electron transfer within individual proteins and in revealing shared electron transfer pathways across protein families.
James R. Gayvert +3 more
wiley +1 more source
Stable Matching Games: Manipulation via Subgraph Isomorphism [PDF]
Algorithmica, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Sushmita, Roy, Sanjukta
openaire +3 more sources
Beating Treewidth for Average-Case Subgraph Isomorphism [PDF]
Algorithmica, 2021 For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of the problem, denoted $G$-$\mathsf{SUB}$, and then solves $G$-$\mathsf{SUB}$ in time $O(n^{tw(G)+1})$ where $tw(G)$
openaire +5 more sources