no code implementations • 9 May 2019 • Abhinav Nellore, Austin Nguyen, Reid F. Thompson
Let $G = (V, E)$ be a digraph where each vertex is unlabeled, each edge is labeled by a character in some alphabet $\Omega$, and any two edges with both the same head and the same tail have different labels.
Data Structures and Algorithms