Buscar
Mostrando ítems 1-10 de 99
Isomorphism of graph classes related to the circular-ones property
(Discrete Mathematics and Theoretical Computer Science, 2013-03)
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, ...
The isomorphism problem for graph magma algebras
(One-value) graph magma algebras are algebras having a basis B = V boolean OR {1} such that, for all u,v is an element of V, uv is an element of {u,0}. Such bases induce graphs and, conversely, certain types of graphs ...
An equivalent formulation for the graph isomorphism problem
(Universidad Nacional de Costa Rica, 2016)
Teoria Espectral e o Problema de Isomorfismo de Grafos Regulares
(Universidade Federal do Espírito SantoBRCiência da ComputaçãoPrograma de Pós-Graduação em InformáticaUFES, 2011-08-29)
Spectral Graph Theory (SGT) studies graph properties by graph representation matrix and its spectrum. A property from SGT, the eigencentrality, provides an important invariant to Graph Isomorphism Problem: if two graphs ...
Isomorfismo de grafos y de funciones lógicas con algunas aplicacionesIsomorfismo de grafos y de funciones lógicas con algunas aplicaciones
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 1998)
Canonical forms for isomorphic and equivalent RDF graphs: algorithms for leaning and labelling blank nodes
(ASSOC COMPUTING MACHINERY, 2017)
Existential blank nodes greatly complicate a number of fundamental operations on RDF graphs. In particular,
the problems of determining if two RDF graphs have the same structure modulo blank node labels (i.e. if they
are ...
Teoria Espectral de Grafos aplicada ao problema de Isomorfismo de Grafos
(Universidade Federal do Espírito SantoBRCiência da ComputaçãoPrograma de Pós-Graduação em InformáticaUFES, 2010-08-23)
In this work we investigated the use of concepts from Spectral Graph Theory (SGT) to support the construction of algorithms that solve the Graph Isomorphism Problem (GIP). Three theoretical results which consider information ...