Results 161 to 170 of about 6,246 (257)

Uncertain Attribute Graph Sub-Graph Isomorphism and its Determination Algorithm

open access: yes, 2014
The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph.
Zhang, Chunying, Zhao, Yanjun
core  

Completeness results for Graph Isomorphism

open access: yes, 2002
We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC². In particular we show that tree isomorphism, when trees are encoded
Johannes Köbler   +7 more
core   +1 more source

Predicting SARS‐CoV‐2 Infection With Graph Attention Capsule Networks

open access: yesComputational Intelligence, Volume 42, Issue 3, June 2026.
ABSTRACT Recent studies in machine learning have demonstrated the effectiveness of applying graph neural networks (GNNs) to single‐cell RNA sequencing (scRNA‐seq) data to predict COVID‐19 disease states. In this study, we propose an explainable graph attention capsule network (GACapNet), which extracts and fuses Severe Acute Respiratory Syndrome ...
Runjie Zhu   +4 more
wiley   +1 more source

Graph isomorphism detection program

open access: yes, 1993
This thesis mainly revolves around the topic of graph isomorphism. A computer program is developed to determine whether the two graphs given by the user are isomorphic or not.
Torres, Emmanuel Ronald
core  

Coherent algebras and the graph isomorphism problem

open access: yes, 1989
In this paper we study the graph isomorphism problem via coherent algebras. We show that any nontrivial graph isomorphism problem reduces polynomially to the problem when an isomorphism of two coherent algebras ι: A→B is a strong isomorphism.
Friedland, Shmuel
core   +1 more source

Bridging privacy-preserving approaches: a formal comparison of k-automorphism, k-isomorphism, and k-symmetry

open access: yesEURASIP Journal on Information Security
Anonymization of graph data is fundamental to preserving users’ privacy while publishing social network datasets. The strongest privacy guarantees against any structural attacks provide three well-known methods: k-automorphism, k-isomorphism and k ...
Jana Medková
doaj   +1 more source

The Contemporary Debate on Secularization and Its Cross‐National Variation: A Systematization Through Topic Modeling

open access: yesJournal for the Scientific Study of Religion, Volume 65, Issue 2, Page 293-306, June 2026.
ABSTRACT Secularization is a key concept in the social scientific study of religion, yet its meaning remains ambiguous due to varied definitions produced in the literature. This article aims to provide a data‐driven systematization of the debate on religious change by analyzing 1638 academic articles published between 2001 and 2022 using structural ...
Valeria Rainero, Ruud Luijkx
wiley   +1 more source

The Graph Isomorphism Problem (Dagstuhl Seminar 15511)

open access: yes, 2016
This report documents the program and the outcomes of Dagstuhl Seminar 15511 "The Graph Isomorphism Problem". The goal of the seminar was to bring together researchers working on the numerous topics closely related to the Isomorphism Problem to foster ...
Schweitzer, Pascal   +3 more
core   +1 more source

Stable factorization of the Calderón problem via the Born approximation

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract In this article, we prove the existence of the Born approximation in the context of the radial Calderón problem for Schrödinger operators. The Born approximation naturally appears as the linear component of a factorization of the Calderón problem; we show that the nonlinear part, obtaining the potential from the Born approximation, enjoys ...
Thierry Daudé   +3 more
wiley   +1 more source

Quantum isomorphism of 2-graphs

open access: yesInternational Journal of Mathematics
We formulate a notion of the quantum automorphism group of a [Formula: see text]-graph. After some preliminary computations, we define quantum isomorphism between a pair of [Formula: see text]-graphs. We produce a “nontrivial” example of a pair of [Formula: see text]-graphs that are not quantum isomorphic to each other.
Soumalya Joardar   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy