isomorphism problem

isomorphism problem

[‚ī·sə′mȯr‚fiz·əm ‚präb·ləm]
(mathematics)
For two simple graphs with the same numbers of vertices and edges, the problem of determining whether there exist correspondences between these vertices and edges such that there is an edge between two vertices in one graph if and only if there is an edge between the corresponding vertices in the other.
References in periodicals archive ?
In contrast to this widespread use, our understanding of the theoretical foundation (namely the graph isomorphism problem) is incomplete and current algorithmic symmetry tools are inadequate for big data applications.
Next generation algorithms for grabbing and exploiting symmetry
Among the topics are Lie algebras of special derivation, the isomorphism problem, and pairings of induced modules.
Simple Lie Algebras Over Fields of Positive Characteristic; Volume I: Structure Theory, 2nd Edition
Agrawal, "On canonical numbering of kinematic chains and isomorphism problem: MAX code," in Proceedings of the ASME Mechanisms Conference, pp.
Agrawal, "Canonical numbering of kinematic chains and isomorphism problem: min code," Mechanism and Machine Theory, vol.
An Algorithm for Identifying the Isomorphism of Planar Multiple Joint and Gear Train Kinematic Chains
A new algorithm efficiently solves the graph isomorphism problem, computer scientist Laszlo Babai announced November 10 at a Combinatorics and Theoretical Computer Science seminar at the University of Chicago.
The graph isomorphism problem requires a computer to examine two graphs that may look very different and determine whether all the balls share the same connections.
New algorithm cracks graph problem: computer science advance helps identify identical networks
* Martin Fiirer (Penn State U.): Combinatorial Methods for the Graph Isomorphism Problem
Combinatorics, groups, algorithms, and complexity: conference in honor of Laci Babai's 60th birthday
The Graph Isomorphism Problem. University of Alberta.
A novel graph containment query algorithm on graph databases
Among their topics are the isomorphism problem for Coxeter groups, hyperbolic Coxeter groups and space forms, equivelar polyhedra, configurations of points and lines, and the reciprocal inspiration of Coxeter and artists.
The Coxeter legacy; reflections and projections
Examples include simultaneous surface resolution in quadratic and biquadratic Galois extensions, asymptotic behavior of cohomology, conic divisor classes over a normal monoid algebra, Rees algebras of the second syzygy module of the residue field of a regular local ring, a local global principle for the elementary unimodular vector group, picture invariants and the isomorphism problem for complex semisimple Lie algebras, arithmetic rank of certain Segre products, and strong semistability and Hilbert-Kunz multiplicity for singular plane curves.
Commutative algebra and algebraic geometry; proceedings
Some such problems of practical relevance include fundamental partition problems in graph theory, isomorphism problems in combinatorics, and strategy-design problems in mathematical game theory.
AUTAR: A Unified Theory of Algorithmic Relaxations
Encyclopedia browser ?
Full browser ?