Yixin Cao

activity

20102024

most citedKGAT: Knowledge Graph Attention Network for Recommendation

2.2k citations · 2.3k across the 10 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2013★ 3 cited

A note on small cuts for a terminal

Yixin Cao

Given a graph $G = (V, E)$ and a terminal $s \in V$ , a cut $X$ for $s$ is a vertex set that contains $s$ . We look for a cut that is small in two senses, i.e., there are no more than…

cs.DS2010

FAST: Kernelization based on Graph Modular Decomposition

Yixin Cao, Jianer Chen

Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of fina…