Corpus ID: 211132678

Directed Graph Hashing

@article{Helbling2020DirectedGH,
  title={Directed Graph Hashing},
  author={Caleb Helbling},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.06653}
}
This paper presents an algorithm for structurally hashing directed graphs. The algorithm seeks to fulfill the recursive principle that a hash of a node should depend only on the hash of its neighbors. The algorithm works even in the presence of cycles, which prevents a naive recursive algorithm from functioning. We also discuss the implications of the recursive principle, limitations of the algorithm, and potential use cases. 

References

SHOWING 1-10 OF 19 REFERENCES
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
  • 216
  • PDF
Depth-First Search and Linear Graph Algorithms
  • R. Tarjan
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1972
  • 5,915
  • PDF
The complexity of McKay's canonical labeling algorithm
  • T. Miyazaki
  • Mathematics, Computer Science
  • Groups and Computation
  • 1995
  • 104
  • PDF
Practical graph isomorphism, II
  • 1,137
  • PDF
The graph isomorphism disease
  • 507
The Graph Isomorphism Problem: Its Structural Complexity
  • 494
Introduction to Algorithms
  • 7,822
  • PDF
The MD5 Message-Digest Algorithm
  • 3,915
  • PDF
A Variadic Extension of Curry's Fixed-Point Combinator
  • M. Goldberg
  • Computer Science
  • High. Order Symb. Comput.
  • 2005
  • 5
  • PDF
...
1
2
...