MARC보기
LDR02011nmm uu200397 4500
001000000334277
00520240805180002
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438135116
035 ▼a (MiAaPQ)AAI10903686
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0820 ▼a 004
1001 ▼a Kabir, Humayun.
24510 ▼a Hierarchical Sparse Graph Computations on Multicore Platforms.
260 ▼a [S.l.] : ▼b The Pennsylvania State University., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 160 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
5021 ▼a Thesis (Ph.D.)--The Pennsylvania State University, 2018.
520 ▼a Graph analysis is widely used to study connectivity, centrality, community and path analysis of social networks, biological networks, communication networks and any interacting objects that can be represented as graphs. Graphs are ubiquitous and
520 ▼a To analyze connectivity, centrality and robustness of a graph, it is useful to find the densely connected subgraphs (cohesive subgraphs) of a graph. One of the contributions of this thesis is to design parallel algorithms for computing cohesive
520 ▼a In centrality analysis and scientific computing, an important kernel is sparse matrix-vector multiplication (SpMV). Another contribution of this thesis, is to develop a multi-level data structure (CSR-k) to store sparse matrices/graphs to speedu
590 ▼a School code: 0176.
650 4 ▼a Computer science.
650 4 ▼a Computer engineering.
690 ▼a 0984
690 ▼a 0464
71020 ▼a The Pennsylvania State University. ▼b Computer Science and Engineering.
7730 ▼t Dissertation Abstracts International ▼g 79-12B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0176
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15000673 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자