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
Computing the k-core of a graph #9058
Comments
This comment has been minimized.
This comment has been minimized.
nathanncohen
mannequin
changed the title
Compute cores to improve subgraph_search
Computing the k-core of a graph
Aug 2, 2010
comment:3
Attachment: trac_9058.patch.gz I verified the patch and I believe it is ok to be merged. |
comment:4
cool ! Thanks Nathann |
comment:5
Don't forget to update the author and reviewer fields. lsampaio, could you add yourself to the account name-real name map? |
Author: Nathann Cohen |
Reviewer: Leonardo Sampaio |
comment:6
ok, I did it =) |
Merged: sage-4.6.alpha3 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This patch adds an option to the
cores
method, so that it returns both the k-core of a graph and a valid elimination ordering on the vertices out of it (such that their degree is less than k when they are removed)Nathann
CC: @sagetrac-mvngu
Component: graph theory
Author: Nathann Cohen
Reviewer: Leonardo Sampaio
Merged: sage-4.6.alpha3
Issue created by migration from https://trac.sagemath.org/ticket/9058
The text was updated successfully, but these errors were encountered: