Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Link opens in a new tab
Search content at Hong Kong Baptist University
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
I/O efficient k-truss community search in massive graphs
Yuli Jiang
,
Xin HUANG
*
, Hong Cheng
*
Corresponding author for this work
Department of Computer Science
Research output
:
Contribution to journal
›
Journal article
›
peer-review
17
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'I/O efficient k-truss community search in massive graphs'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Community Search
100%
Large Graphs
100%
K-truss
100%
Community Model
33%
Query Processing
16%
Community Detection
16%
Search Problems
16%
Community Connection
16%
Densely Connected
16%
Structural Properties
16%
Computational Properties
16%
External Model
16%
Main Memory
16%
Dependent Communities
16%
Efficient Search
16%
In-memory
16%
Community Size
16%
Search Algorithm
16%
I/O-efficient Algorithms
16%
Linear Cost
16%
Query Dependent
16%
Index Structure
16%
Dynamic Graph
16%
Mathematics
Edge
100%
Community Detection
100%
Query Processing
100%
Search Algorithm
100%
Computer Science
Input/Output
100%
Query Processing
50%
Efficient Algorithm
50%
Community Detection
50%
Main Memory
50%
Searching Algorithm
50%
Index Structure
50%