Results 41 to 50 of about 1,033,312 (247)
Enhanced Graph Isomorphism Network for Molecular ADMET Properties Prediction
The evaluation of absorption, distribution, metabolism, exclusion, and toxicity (ADMET) properties plays a key role in a variety of domains including industrial chemicals, agrochemicals, cosmetics, environmental science, food chemistry, and particularly ...
Yuzhong Peng +5 more
semanticscholar +1 more source
Homomorphic Preimages of Geometric Paths
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete.
Nagoya Takayuki
doaj +1 more source
Energy landscape structure of small graph isomorphism under variational optimization [PDF]
We investigate a quadratic unconstrained binary optimization formulation of the graph isomorphism problem using the quantum approximate optimization algorithm and the variational quantum eigensolver.
Turbasu Chatterjee +2 more
doaj +1 more source
Knowledge Graph Question Answering using Graph-Pattern Isomorphism [PDF]
Knowledge Graph Question Answering (KGQA) systems are often based on machine learning algorithms, requiring thousands of question-answer pairs as training examples or natural language processing pipelines that need module fine-tuning.
Daniel Vollmers +9 more
semanticscholar +1 more source
An Optimization of Closed Frequent Subgraph Mining Algorithm
Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
Approximate Graph Isomorphism [PDF]
We study optimization versions of Graph Isomorphism. Given two graphs G1,G2, we are interested in finding a bijection π from V(G1) to V(G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges).
Vikraman Arvind +3 more
openaire +2 more sources
Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial [PDF]
The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence.
M. Bardet, A. Otmani, Mohamed Saeed-Taha
semanticscholar +1 more source
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability [PDF]
Mančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al.
Prem Nigam Kar +3 more
doaj +1 more source
A Study of Complex Dombi Fuzzy Graph With Application in Decision Making Problems
A complex fuzzy set (CFS) is a generalization of a fuzzy set (FS) in which a limit of degrees occurs on the complex plane with unit disc. The averaging operators are a key part of turning all the data into one value.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source

