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.
- Pub Date:
- February 2020
- Computer Science - Discrete Mathematics;
- Computer Science - Data Structures and Algorithms;
- Presented at 51st Southeastern International Conference on Combinatorics, Graph Theory &