Results 41 to 50 of about 615,797 (257)
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism [PDF]
ACM Transactions on Computation Theory, 2013 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-in with O (log log n ) depth and
Chattopadhyay, Arkadev +2 more
openaire +4 more sources
Graph isomorphism : Some special cases [PDF]
, 1987 This paper investigates some special cases of graphs with a small number of vertices or edges where a characteristic property of the vertices and edges already determines the graph up to isomorphism.
Socher, Rolf
core +1 more source
Quantifying the non-isomorphism of global urban road networks using GNNs and graph kernels
Scientific ReportsA novel concept of quantifying graph non-isomorphism is introduced to measure structural differences between graphs, and thus overcoming the strict limitations of traditional graph isomorphism tests.
Linfang Tian +3 more
doaj +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
Abstract Euler Diagram Isomorphism [PDF]
, 2008 Euler diagrams are widely used for information visualization and form the basis of a variety of formal languages that are used to express constraints in computing.
Andrew Fish +6 more
core
Reductions to Graph Isomorphism
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
An Efficient Algorithm for Graph Isomorphism [PDF]
Journal of the ACM, 1970 A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructed from the representative graph to be isomorphic to the ...
Derek G. Corneil, C. C. Gotlieb
openaire +2 more sources
On‐Chip Photonic Neural Network Architectures
Advanced Optical Materials, EarlyView.This review presents a comprehensive overview of on‐chip photonic neural network architectures, covering key photonic building blocks, representative network types, and emerging applications. Recent advances, implementation challenges, and future directions are examined, highlighting the potential of integrated photonics to enable ultrafast, energy ...
Seokjin Hong +7 more
wiley +1 more source
Fuzzy Number-Valued Fuzzy Graph [PDF]
Control and Optimization in Applied Mathematics, 2016 Graph theory has an important role in the area of applications of networks and clustering. In the case of dealing with uncertain data, we must utilize ambiguous data such as fuzzy value, fuzzy interval value or values of fuzzy number.
Siyamak Firouzian +1 more
doaj