#9058: Computing the k-core of a graph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.5.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Old description:
> If one is looking for H in G, then we may assume the minimum degree of G
> is larger than the minimum degree of H. We can assume the same for the
> complement when computing an induced subgraph. Take care of directed
> graphs.
>
> requires #8922
>
> Nathann
New description:
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
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9058#comment:2>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
