Opened 9 years ago

Closed 9 years ago

#9058 closed enhancement (fixed)

Computing the k-core of a graph

Reported by: ncohen Owned by: jason, ncohen, rlm
Priority: major Milestone: sage-4.6
Component: graph theory Keywords:
Cc: mvngu Merged in: sage-4.6.alpha3
Authors: Nathann Cohen Reviewers: Leonardo Sampaio
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Description (last modified by ncohen)

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

Attachments (1)

trac_9058.patch (2.8 KB) - added by ncohen 9 years ago.

Download all attachments as: .zip

Change History (8)

comment:1 Changed 9 years ago by ncohen

  • Status changed from new to needs_work

comment:2 Changed 9 years ago by ncohen

  • Description modified (diff)
  • Status changed from needs_work to needs_review
  • Summary changed from Compute cores to improve subgraph_search to Computing the k-core of a graph

Changed 9 years ago by ncohen

comment:3 Changed 9 years ago by lsampaio

  • Status changed from needs_review to positive_review

I verified the patch and I believe it is ok to be merged.

comment:4 Changed 9 years ago by ncohen

cool ! Thanks ;-)

Nathann

comment:5 Changed 9 years ago by mpatel

  • Authors set to Nathann Cohen
  • Reviewers set to Leonardo Sampaio

Don't forget to update the author and reviewer fields. lsampaio, could you add yourself to the account name-real name map?

comment:6 Changed 9 years ago by lsampaio

ok, I did it =) thank you for pointing this!

comment:7 Changed 9 years ago by mpatel

  • Merged in set to sage-4.6.alpha3
  • Resolution set to fixed
  • Status changed from positive_review to closed
Note: See TracTickets for help on using tickets.