Results 11 to 20 of about 6,219 (246)
Relaxations of Graph Isomorphism [PDF]
, 2017 We introduce a nonlocal game that captures and extends the notion of graph isomorphism. This game can be won in the classical case if and only if the two input graphs are isomorphic.
Samal, Robert +7 more
core +5 more sources
Focality and graph isomorphism
Discrete Mathematics, 1990 A graph is focal if the stabiliser of every vertex x fixes exactly one edge not incident with x. It is shown that the problem of testing whether a connected bipartite grpah is focal has the same complexity as the graph isomorphism problem.
Imrich, W., Sabidussi, G.
core +2 more sources
Smoothed analysis for graph isomorphism [PDF]
Proceedings of the 57th Annual ACM Symposium on Theory of ComputingThere is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial “refinement” algorithms seem to be very efficient in practice. Some philosophical justification for this phenomenon is provided by a classical theorem
Moore, Benjamin +2 more
core +3 more sources
Graph Isomorphism is not AC^0 reducible to Group Isomorphism [PDF]
ACM Transactions on Computation Theory, 2010 We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-
Wagner, Fabian +2 more
core +6 more sources
, 2019 In this article we review some of the most relevant properties related to graph isomorphism and graph components. We start by introducing some concepts related to graph traversal (walks, paths, cycles, circuits), then we introduce two natural concepts ...
Dondi, Riccardo
core +2 more sources
We review some of the most relevant properties related to graph isomorphism and graph components. First, we introduce some concepts related to graph traversal (walks, paths, cycles, circuits) and we introduce two natural concepts related to connectivity:
Dondi, Riccardo
core +3 more sources
Notion of Complex Spherical Dombi Fuzzy Graph and Its Application in Decision-Making Problems
IEEE Access, 2023 The complex spherical fuzzy graph (CSFG), which extends the concept of a spherical fuzzy graph (SFG), proves to be a more effective means of depicting relationships among diverse objects when these relationships are subject to uncertainty.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source
Testing graph isomorphism [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 Two graphs $G$ and $H$ on $n$ vertices are $\epsilon$-far from being isomorphic if at least $\epsilon\binom{n}{2}$ edges must be added or removed from $E(G)$ in order to make $G$ and $H$ isomorphic. In this paper we deal with the question of how many queries are required to distinguish between the case that two graphs are isomorphic and the case that ...
Eldar Fischer, Arie Matsliah
openaire +2 more sources
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
An Efficient Subgraph Isomorphism Solver for Large Graphs
IEEE Access, 2021 For a given pair of pattern and data graphs, the subgraph isomorphism finding problem locates all instances of the pattern graph into the data graph. For a given subgraph isomorphic image of the pattern graph in a data graph, the set of all ordered pairs
Zubair Ali Ansari +2 more
doaj +1 more source