{
"item_title" : "Cohesive Subgraph Computation Over Large Sparse Graphs",
"item_author" : [" Lijun Chang", "Lu Qin "],
"item_description" : "Introduction.- Linear Heap Data Structures.- Minimum Degree-based Core Decomposition.- Average Degree-based Densest Subgraph Computation.- Higher-order Structure-based Graph Decomposition.- Edge Connectivity-based Graph Decomposition.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/003/598/3030035980_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Cohesive Subgraph Computation Over Large Sparse Graphs : Algorithms, Data Structures, and Programming Techniques
by Lijun Chang and Lu Qin
Overview
Introduction.- Linear Heap Data Structures.- Minimum Degree-based Core Decomposition.- Average Degree-based Densest Subgraph Computation.- Higher-order Structure-based Graph Decomposition.- Edge Connectivity-based Graph Decomposition.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783030035983
- ISBN-10: 3030035980
- Publisher: Springer
- Publish Date: January 2019
- Dimensions: 9.21 x 6.14 x 0.31 inches
- Shipping Weight: 0.77 pounds
- Page Count: 107
Related Categories
