We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Some efficient and easy to implement algorithms have appeared recently for the problem of graph dismantling. We should implement them in LightGraphs
One is here
http://arxiv.org/pdf/1506.08326 (CI algorithm)
and another here
http://arxiv.org/pdf/1607.03276v1.pdf (CoreHD algorithm)
The text was updated successfully, but these errors were encountered:
CI algorithm implemented in #23
CoreHD still to implement
Sorry, something went wrong.
No branches or pull requests
Some efficient and easy to implement algorithms have appeared recently for the problem of graph dismantling. We should implement them in LightGraphs
One is here
http://arxiv.org/pdf/1506.08326 (CI algorithm)
and another here
http://arxiv.org/pdf/1607.03276v1.pdf (CoreHD algorithm)
The text was updated successfully, but these errors were encountered: