433 citations · 968 across the 48 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023★ 8 cited
Towards Generating Hop-constrained s-t Simple Path Graphs
Yuzheng Cai, Siyuan Liu, Weiguo Zheng +1
Graphs have been widely used in real-world applications, in which investigating relations between vertices is an important task. In this paper, we study the problem of generating t…
cs.DS2022
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
cs.DS2018
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
Haida Zhang, Zengfeng Huang, Xuemin Lin +3
Driven by many real applications, we study the problem of seeded graph matching. Given two graphs and , and a small set of pre-matched node…