Results 51 to 60 of about 55,019 (192)
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
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
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
Vague Mereology and Borderline Connections
Philosophy and Phenomenological Research, EarlyView.ABSTRACT The summit of Mt Everest is determinately part of it; parts of the Khumbu Glacier are determinately not. In between are a range of candidate parts whose mereological status with respect to Mt Everest is unsettled. Among the various accounts of vagueness, supervaluationism has received a great deal of attention.
A. J. Cotnoir, Giulia Schirripa
wiley +1 more source
On the Limits of Intransitive Coordination
Ratio, EarlyView.ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
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
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.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
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
IEEE AccessSubgraph 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 +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