graph canonization
computational problem
Press Enter · cited answer in seconds
0 sources
graph canonization
Summary
graph canonization is a computational problem[1].
Key Facts
- graph canonization's instance of is recorded as computational problem[2].
- graph canonization's Freebase ID is recorded as /m/04ydpqz[3].
- graph canonization's studied by is recorded as graph theory[4].
- graph canonization's studied by is recorded as computational complexity theory[5].
- graph canonization's MathWorld ID is recorded as CanonicalLabeling[6].
- graph canonization's maintained by WikiProject is recorded as WikiProject Mathematics[7].
- graph canonization's Microsoft Academic ID is recorded as 139027177[8].