公开(公告)号：US20240087076A1

公开(公告)日：2024-03-14

申请号：US18463386

申请日：2023-09-08

申请人： KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY

发明人： Min-Soo KIM ,  Seyeon OH ,  Donghyoung HAN ,  Inju NA

IPC分类号： G06T1/20 ,  G06T1/60

CPC分类号： G06T1/20 ,  G06T1/60

摘要： Provided are a graph data calculation method and apparatus. A computing device divides graph data including a source vertex and a destination vertex of an edge into a plurality of blocks, and identifies an out-degree of each vertex. Next, the computing device repeatedly performs a process of calculating, in units of blocks, a weight of a destination vertex of each edge by using a pagerank and an out-degree of a source vertex of each edge existing in a block, and updating a pagerank of each vertex of the graph data by accumulating a weight of a destination vertex of each block.

公开(公告)号：US20240095305A1

公开(公告)日：2024-03-21

申请号：US18463521

申请日：2023-09-08

申请人： KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY

发明人： Min-Soo KIM ,  Seyeon OH ,  Donghyoung HAN ,  Inju NA ,  Heeyong YOON ,  Sungwoo PARK

IPC分类号： G06F17/16

CPC分类号： G06F17/16

摘要： Provided are a method and apparatus for obtaining a triangle in a graph. A computing device receives an adjacency matrix in which two vertices connected to an edge are expressed in rows and columns, divides the adjacency matrix into a plurality of blocks, searches for a search area including a plurality of blocks located at (I,K), (I,J), and (J,K) satisfying I>=J>=K (where I, J, and K are block indexes) for the plurality of blocks existing in the adjacency matrix, and identifies three vertices forming a triangle based on edge information existing in the search area.

公开(公告)号：US20240088913A1

公开(公告)日：2024-03-14

申请号：US18463444

申请日：2023-09-08

申请人： KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY

发明人： Min-Soo KIM ,  Seyeon OH ,  Donghyoung HAN ,  Inju NA ,  Sungwoo PARK

IPC分类号： H03M7/30

CPC分类号： H03M7/3064 ,  H03M7/3066

摘要： Provided are a graph data compression method and apparatus. A computing device divides graph data including information about a source vertex and a destination vertex of an edge into a plurality of pieces, generates a plurality of compressed data obtained by compressing the plurality of pieces, and stores the plurality of compressed data as a file. The computing device may generate a plurality of pieces having a size equal to or less than a predefined data size by recursively dividing graph data.