1 problem

0 votes0 replies1 view
Near-linear running time for parallel edge enumeration on graphs with few bisimulations
Running-time conjecture. The parallel edge enumeration algorithm may run in
Conjectureopenbisimulation canonical-labelling graph-isomorphismarXiv posted 2 days ago