3 papers
cs.DS2025
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
Jihoon Jang, Yehyun Nam, Kunsoo Park +1
A -defective clique is a relaxation of the traditional clique definition, allowing up to missing edges. This relaxation is crucial in various real-world applications such as…
cs.DB2025
DIST: Efficient k-Clique Listing via Induced Subgraph Trie
Yehyun Nam, Jihoon Jang, Kunsoo Park +2
Listing k-cliques plays a fundamental role in various data mining tasks, such as community detection and mining of cohesive substructures. Existing algorithms for the k-clique list…
cs.DB2023
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking
Seunghwan Min, Jihoon Jang, Kunsoo Park +3
Real-time analysis of graphs containing temporal information, such as social media streams, Q&A networks, and cyber data sources, plays an important role in various applications. A…