Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

对于任意一个图是否可以在一定时间内获取到它的最小DFSCode #24

Open
Sjunhao opened this issue Nov 3, 2022 · 0 comments

Comments

@Sjunhao
Copy link

Sjunhao commented Nov 3, 2022

对于任意一组图,能否通过GSpan算法,对每个图进行编码,获取到最小DFScode,用来比较图同构呢?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant