Results 151 to 160 of about 6,246 (257)
On graph isomorphism for restricted graph classes
, 2006 Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P.
Johannes Köbler
core +1 more source
GRAPH ISOMORPHISM AND CIRCUIT ISOMORPHISM
, 2018 In this note, we show that graph isomorphism and some of its variant are both reducible to circuit isomorphism problem, in polynomial time.
openaire +2 more sources
On the Lang–Trotter conjecture for Siegel modular forms
Mathematika, Volume 72, Issue 3, July 2026.Abstract Let f$f$ be a genus‐two cuspidal Siegel eigenform. We prove an adelic open image theorem for the compatible system of Galois representations associated with f$f$, generalizing the results of Ribet and Momose for elliptic modular forms. Using this result, we investigate the distribution of the Hecke eigenvalues ap$a_p$ of f$f$, and obtain upper
Arvind Kumar, Moni Kumari, Ariel Weiss
wiley +1 more source
Solar RRL, Volume 10, Issue 11, 15 June 2026.The efficiency of organic solar cells arises from complex donor–acceptor interactions rather than isolated molecular properties. A hierarchical graph transformer is introduced to model multilevel interactions across atomic, motif, and molecular scales, enabling more accurate prediction of power conversion efficiency and improved prediction performance ...
Ting Zhang +5 more
wiley +1 more source
A polynomial-time algorithm for simple undirected graph isomorphism
, 2019 The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial‐time solution. This paper solves the simple undirected graph isomorphism problem with an algorithmic approach as NP=P and proposes a ...
Zarei, Roozbeh +13 more
core +1 more source
Graph isomorphism and multivariate graph spectrum
Advances in Applied MathematicsWe provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach suggests that almost all graphs are identified by their generalized block Laplacian spectrum.
Wei Wang 0195, Da Zhao
openaire +2 more sources
Topological Graph Neural Networks: A Novel Approach for Geometric Deep Learning
Applied AI Letters, Volume 7, Issue 2, June 2026.This graphical abstract illustrates the Topological Graph Neural Network (TopGNN) architecture. It demonstrates a parallel processing approach where an input graph is simultaneously analyzed by a standard GNN Encoder to capture local node features and by Persistent Homology to extract global topological features (like cycles and voids), visualized as a
Amarjeet +7 more
wiley +1 more source
Graph Isomorphism, General Remarks
, 2012 An open question is the computational complexity of recognizing when two graphs are isomorphic. In an attempt to answer this question we shall analyze the relative computational complexity of generalizations and restrictions of the graph isomorphism ...
Miller, Gary L.
core
NLC-2 graph recognition and isomorphism
, 2007 International audienceNLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two.
Vincent Limouzy +5 more
core +1 more source
Transfer Learning Approaches in Bioprocess Engineering: Opportunities and Challenges
Biotechnology and Bioengineering, Volume 123, Issue 6, Page 1417-1431, June 2026.ABSTRACT Transfer learning (TL) has recently emerged as a promising approach to overcoming one of the key limitations of bioprocess engineering: data scarcity. By leveraging knowledge from one bioprocess to another, TL allows existing models and data sets to be reused efficiently, accelerating process development, improving prediction accuracy, and ...
Daniel Barón Díaz +3 more
wiley +1 more source