Results 11 to 20 of about 615,797 (257)
The graph isomorphism problem on geometric graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it's time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm
Ryuhei Uehara, Uehara, Ryuhei
core +5 more sources
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 [PDF]
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 +3 more sources
Graph isomorphism, general remarks [PDF]
Journal of Computer and System Sciences, 1979 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 +4 more sources
New Mathematics and Natural Computation, 2023 The soft set theory provides a flexible framework for dealing with uncertain and imprecise information that is not adequately handled by classical set theory.
Jinta Jose +2 more
core +3 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 +5 more sources
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
Random Graph Isomorphism [PDF]
SIAM Journal on Computing, 1980 Summary: A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but \(O(2^{\binom n2})\) of the \(2^{\binom n2})\) graphs on \(n\) vertices). Hence, for almost all graphs \(X\), and graph \(Y\) can be easily tested for isomorphism to \(X\) by an extremly naive linear time algorithm.
László Babai +2 more
openaire +3 more sources
Graphs isomorphic to their path graphs [PDF]
Mathematica Bohemica, 2002 Summary: We prove that for every number \(n\geq 1\), the \(n\)-iterated \(P_3\)-path graph of \(G\) is isomorphic to \(G\) if and only if \(G\) is a collection of cycles, each of length at least 4. Hence, \(G\) is isomorphic to \(P_3(G)\) if and only if \(G\) is a collection of cycles, each of length at least 4.
Knor, Martin, Niepel, L'udovít
openaire +1 more source
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 more
core +1 more source