Subcategories
Tags
Language
Tags
<<
May 2024
Su Mo Tu We Th Fr Sa
28 29 30 1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31 1
  1. Home
  2. eBooks & eLearning
  3. graph algorithm

Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Posted By: AvaxGenius
Date: 2 Jun 2022 07:24:20
Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Cohesive Subgraph Search Over Large Heterogeneous Information Networks by Yixiang Fang
English | EPUB | 2022 | 86 Pages | ISBN : 3030975673 | 2.9 MB

This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs.
Details

Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Posted By: AvaxGenius
Date: 8 May 2022 17:01:41
Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Cohesive Subgraph Search Over Large Heterogeneous Information Networks by Yixiang Fang
English | PDF | 2022 | 86 Pages | ISBN : 3030975673 | 1.9 MB

This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs.
Details

Graphs, Networks and Algorithms

Posted By: AvaxGenius
Date: 16 Jul 2020 12:57:19
Graphs, Networks and Algorithms

Graphs, Networks and Algorithms by Dieter Jungnickel
English | PDF | 597 | 1999 | ISBN : 3662038242 | 50.27 MB

From the reviews of the German edition:
"Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading.
Details
UPWARDS