Hashing and canonicalizing Notation 3 graphs
type: Item
instance of: scholarly article
title: Hashing and canonicalizing Notation 3 graphs
zbMATH Open document ID: 1197.68022
author: Jesus Arias Fisteus
author: Norberto Fernández García
author: Luis Sánchez Fernández
author: Carlos Delgado Kloos
published in: Journal of Computer and System Sciences
publication date: 2010-08-18T00:00:00Z
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5772418
zbMATH Keywords: semantic web
zbMATH Keywords: Notation 3
zbMATH Keywords: RDF
zbMATH Keywords: hash
describes a project that uses: TPTP
describes a project that uses: Ent
MaRDI profile type: Publication
full work available at URL: j.jcss.2010.01.003
OpenAlex ID: W1974294151
cites work: Handbook of Graph Theory
cites work: Isomorphism testing for embeddable graphs through definability
cites work: An Efficient Algorithm for Graph Isomorphism
cites work: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
cites work: Random Graph Isomorphism
cites work: Group-theoretic algorithms and graph isomorphism
cites work: A non-factorial algorithm for canonical numbering of a graph
cites work: Q4369384
cites work: The TPTP problem library. CNF release v1. 2. 1
cites work: Q4398780
DOI: 10.1016/J.JCSS.2010.01.003
Recommended article: Graphs, hypergraphs and hashing
Recommended article: Hash functions and Cayley graphs
Recommended article: Q4304368
Recommended article: Q4037494
Recommended article: A Generic Framework for Engineering Graph Canonization Algorithms
Recommended article: Q4852861
Recommended article: Almost random graphs with simple hash functions
Recommended article: Succinct Encodings of Graph Isomorphism
Recommended article: Three-fast-searchable graphs
description: scientific article; zbMATH DE number 5772418