Skip to content
Log in
Sponsored AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI

Author

Kai-Qiang Yu

h-index 10 View on Semantic Scholar

We have 3 of 36 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs

This paper proposes MCQC-TD, a specialized exact branch-and-bound framework for the MCQC query, which adopts a top-down search strategy and exploits a novel structural characterization of γ-CQCs to enable effective pruning and guided branching, and substantially reduces the theoretical worst-case complexity compared to...

Yang Liu, He-Jiao Huang, Kai-Qiang Yu et al. · 0 citations
Conference May 2026

Listing Minimal Cores in Large Real-World Graphs

Cohesive subgraph mining is a fundamental task in graph data analytics. We re-visit the problem of listing all minimal $k$-cores, where a $k$-core is a subgraph in which every vertex has degree at least $k$, and minimality requires that no proper subset remains a $k$-core. Existing methods are computationally prohibiti...

Yukai Sun, Kaiqiang Yu, Shengxin Liu et al. · 0 citations
#edge computing Sep 2026

Efficient Minimum $k$-Truss Search: A Decomposition-Based Approach

Cohesive subgraph mining has been extensively studied and finds numerous graph mining applications such as link farm identification, community detection, and product recommendation. Among various cohesive subgraph structures, the <inline-formula><tex-math notation="LaTeX">$k$</tex-math><alternatives><mml:math><mml:mi>k...

Qifan Zhang, Yang Liu, Kaiqiang Yu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.