4 papers
FINOM: Fast Sinkhorn on Non-uniform Meshes
Qihao Cheng, Qichen Liao, Hao Wu +1
A linear-complexity algorithm for computing the Wasserstein-1 distance on non-uniform meshes is proposed. This work extends the fast Sinkhorn algorithms from [Q. Liao et al., Commu…
SPARC-atomSFE: Spectral finite-element package for atomic structure calculations in density functional theory
Qihao Cheng, Shubhang Krishnakant Trivedi, Phanish Suryanarayana
We present SPARC-atomSFE, a spectral finite-element package for accurate and efficient atomic structure calculations within the framework of Kohn-Sham density functional theory. Th…
Computing Approximate Graph Edit Distance via Optimal Transport
Qihao Cheng, Da Yan, Tianhao Wu +2
Given a graph pair , graph edit distance (GED) is defined as the minimum number of edit operations converting to . GED is a fundamental operation widely used…
Efficient Enumeration of Large Maximal k-Plexes
Qihao Cheng, Da Yan, Tianhao Wu +4
Finding cohesive subgraphs in a large graph has many important applications, such as community detection and biological network analysis. Clique is often a too strict cohesive stru…