Product Details

k-core graph decomposition 1.0

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 is a completely free software. You can free download and use it as long as you like.

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.

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.

Academic Free License (AFL)


User Reviews: K-CORE GRAPH DECOMPOSITION 1.0
 * 
 * 
     
 * 
related terms
Similar Download Catalog
 
a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z