Results 11 to 20 of about 87,870 (251)
Graph isomorphism completeness for trapezoid graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of ...
Takaoka, Asahi
core +3 more sources
Isomorphisms between dense random graphs [PDF]
Combinatorica, 2023 We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prove a sharp threshold result for the appearance of G_{n,p_1} as an induced subgraph of G_{N,p_2}, (ii) we show two-point concentration of the size of the maximum common induced
Erlang Surya, Lutz Warnke, Emily Zhu
openalex +3 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 +1 more source
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.
Babai, Laszlo +2 more
openaire +2 more sources
A new method for isomorphism identification of planetary gear trains [PDF]
Mechanical Sciences, 2021 Planetary gear trains (PGTs) are widely used in machinery such as vehicles, pulley blocks, wrist watches, machine tools, and robots. During the process of structural synthesis of PGTs using graph theory, isomorphism identification of graphs is an ...
W. Sun +7 more
doaj +1 more source
HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases
Journal of Big Data, 2022 The big graph database provides strong modeling capabilities and efficient querying for complex applications. Subgraph isomorphism which finds exact matches of a query graph in the database efficiently, is a challenging problem.
Merve Asiler, Adnan Yazıcı, Roy George
doaj +1 more source
Continuous Latent Spaces Sampling for Graph Autoencoder
Applied Sciences, 2023 This paper proposes colaGAE, a self-supervised learning framework for graph-structured data. While graph autoencoders (GAEs) commonly use graph reconstruction as a pretext task, this simple approach often yields poor model performance.
Zhongyu Li +4 more
doaj +1 more source
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 more sources
Canonizing Graphs of Bounded Tree Width in Logspace [PDF]
, 2015 Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal.
Elberfeld, Michael, Schweitzer, Pascal
core +2 more sources
Graph Isomorphism for Unit Square Graphs
, 2016 In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show that the Graph Isomorphism Problem for unit square graphs, intersection graphs of axis-parallel unit squares in ...
Daniel Neuen +2 more
openalex +6 more sources