Results 21 to 30 of about 6,219 (246)
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
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 +2 more sources
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
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
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
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
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Graph Isomorphism Restricted by Lists [PDF]
Theoretical Computer Science, 2020 The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs $G$ and $H$, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each $u \in V(G)$, we are given a list ${\mathfrak L}(u ...
Pavel Klavík +2 more
openaire +2 more sources