國立虎尾科技大學 |

Cohesive Subgraph Computation over Large Sparse Graphs = Algorithms, Data Structures, and Programming Techniques /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Cohesive Subgraph Computation over Large Sparse Graphs/ by Lijun Chang, Lu Qin.
Reminder of title:	Algorithms, Data Structures, and Programming Techniques /
Author:	Chang, Lijun.
other author:	Qin, Lu.
Description:	XII, 107 p. 21 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-03599-0
ISBN:	9783030035990

Cohesive Subgraph Computation over Large Sparse Graphs = Algorithms, Data Structures, and Programming Techniques /
Chang, Lijun.

Cohesive Subgraph Computation over Large Sparse GraphsAlgorithms, Data Structures, and Programming Techniques /[electronic resource] :by Lijun Chang, Lu Qin. - 1st ed. 2018. - XII, 107 p. 21 illus., 1 illus. in color.online resource. - Springer Series in the Data Sciences,2365-5674. - Springer Series in the Data Sciences,.

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 book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book. This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.

ISBN: 9783030035990

Standard No.: 10.1007/978-3-030-03599-0doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

Cohesive Subgraph Computation over Large Sparse Graphs = Algorithms, Data Structures, and Programming Techniques /
LDR:02668nam a22003975i 4500 001 989735
003 DE-He213
005 20200702013243.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030035990 $9 978-3-030-03599-0
024 7 $a 10.1007/978-3-030-03599-0 $2 doi
035 $a 978-3-030-03599-0
050 4 $a QA76.9.A43
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518.1 $2 23
100 1 $a Chang, Lijun. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 841004
245 1 0 $a Cohesive Subgraph Computation over Large Sparse Graphs $h [electronic resource] : $b Algorithms, Data Structures, and Programming Techniques / $c by Lijun Chang, Lu Qin.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XII, 107 p. 21 illus., 1 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Series in the Data Sciences, $x 2365-5674
505 0 $a 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.
520 $a This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book. This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 2 4 $a Data Structures. $3 669824
700 1 $a Qin, Lu. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 841003
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030035983
776 0 8 $i Printed edition: $z 9783030036003
830 0 $a Springer Series in the Data Sciences, $x 2365-5674 $3 1265148
856 4 0 $u https://doi.org/10.1007/978-3-030-03599-0
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)