Results 1 to 10 of about 6,219 (246)

Graph Isomorphism is in SPP [PDF]

open access: yesInformation and Computation, 2006
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, in ModkP for each k⩾2). These inclusions for Graph Isomorphism were not known prior to membership in SPP.
V Arvind
exaly   +5 more sources

The graph isomorphism problem on geometric graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Special issue PRIMA ...
Ryuhei Uehara
doaj   +5 more sources

Identification of Young High-Functioning Autism Individuals Based on Functional Connectome Using Graph Isomorphism Network: A Pilot Study [PDF]

open access: yesBrain Sciences, 2022
Accumulated studies have determined the changes in functional connectivity in autism spectrum disorder (ASD) and spurred the application of machine learning for classifying ASD.
Sihong Yang, Dezhi Jin, Jun Liu, Ye He
doaj   +2 more sources

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2005
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Ryuhei Uehara
exaly   +2 more sources

MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk [PDF]

open access: yesEntropy, 2019
Graph isomorphism is to determine whether two graphs have the same topological structure. It plays a significant role in areas of image matching, biochemistry, and information retrieval.
Kai Liu   +5 more
doaj   +2 more sources

DeepTGIN: a novel hybrid multimodal approach using transformers and graph isomorphism networks for protein-ligand binding affinity prediction [PDF]

open access: yesJournal of Cheminformatics
Predicting protein-ligand binding affinity is essential for understanding protein-ligand interactions and advancing drug discovery. Recent research has demonstrated the advantages of sequence-based models and graph-based models. In this study, we present
Guishen Wang   +5 more
doaj   +2 more sources

Prediction of circRNA–Disease Associations via Graph Isomorphism Transformer and Dual-Stream Neural Predictor [PDF]

open access: yesBiomolecules
Circular RNAs (circRNAs) have attracted increasing attention for their roles in human diseases, making the prediction of circRNA–disease associations (CDAs) a critical research area for advancing disease diagnosis and treatment.
Hongchan Li   +3 more
doaj   +2 more sources

Quantifying the non-isomorphism of global urban road networks using GNNs and graph kernels [PDF]

open access: yesScientific Reports
A novel concept of quantifying graph non-isomorphism is introduced to measure structural differences between graphs, and thus overcoming the strict limitations of traditional graph isomorphism tests.
Linfang Tian   +3 more
doaj   +2 more sources

Improved random graph isomorphism

open access: yesJournal of Discrete Algorithms, 2008
Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem.
Gopal Pandurangan
exaly   +2 more sources

Graph isomorphism—Characterization and efficient algorithms

open access: yesHigh-Confidence Computing
The Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete.
Jian Ren, Tongtong Li
doaj   +3 more sources

Home - About - Disclaimer - Privacy