k-core graph decomposition Icon

k-core graph decomposition

alpha
Add a Review
0 Downloads (This Week)
Last Update:

Description

This small project is used to prune a general graph (not necessary connected) into a graph (induced subgraph) with all vertices' degree greater than predefined cutoff value k. It is mainly a implementation of priority queue.

k-core graph decomposition Web Site

KEEP ME UPDATED

Write a Review

User Reviews

Be the first to post a review of k-core graph decomposition!

Additional Project Details

Intended Audience

Engineering

Programming Language

C

Registered

2009-04-16

Thanks for helping keep SourceForge clean.

Screenshot instructions:
Windows
Mac
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies
X

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks