佛刊 发表于 2025-3-25 04:31:20

http://reply.papertrans.cn/23/2293/229241/229241_21.png

不成比例 发表于 2025-3-25 10:57:16

Minimum Degree-Based Core Decomposition,In this chapter, we discuss efficient techniques for computing the minimum degree-based graph decomposition (aka, .). Preliminaries are given in Section .. A linear-time algorithm is presented in Section ., while .-based local algorithms that can be naturally made parallel are presented in Section ..

细微的差异 发表于 2025-3-25 15:29:33

Higher-Order Structure-Based Graph Decomposition,Higher-order structures, also known as motifs or graphlets, have been recently used to successfully locate dense regions that cannot be detected otherwise by edge-centric methods [., ., .].

夹克怕包裹 发表于 2025-3-25 16:36:41

Edge Connectivity-Based Graph Decomposition,In this chapter, we study edge connectivity-based graph decomposition; that is, each subgraph satisfies a certain edge connectivity requirement.

commonsense 发表于 2025-3-25 23:20:14

http://reply.papertrans.cn/23/2293/229241/229241_25.png

傻瓜 发表于 2025-3-26 00:32:19

Springer Series in the Data Scienceshttp://image.papertrans.cn/c/image/229241.jpg

流出 发表于 2025-3-26 08:12:32

8楼

致敬 发表于 2025-3-26 11:28:38

8楼

Ruptured-Disk 发表于 2025-3-26 12:53:10

8楼

conspicuous 发表于 2025-3-26 20:45:10

9楼
页: 1 2 [3] 4
查看完整版本: Titlebook: Cohesive Subgraph Computation over Large Sparse Graphs; Algorithms, Data Str Lijun Chang,Lu Qin Book 2018 Springer Nature Switzerland AG 20