Project Summary
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.
In a Nutshell, k-core graph decomposition...
Academic Free License v3.0
Permitted
Commercial Use
Modify
Distribute
Sub-License
Forbidden
Hold Liable
Use Trademarks
Required
Distribute Original
Disclose Source
Include Copyright
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
check out hot projects on the Open Hub
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
