Author

Qiang Tian

h-index 6 View on Semantic Scholar

We have 1 of 15 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.

Preprint Aug 2026

Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity

The main result is an explicit optimal embedding of cluster graphs on $n$ vertices, which is strongly NP-complete and admits no FPTAS, while the farthest alignment is polynomial-time solvable.

Jiye Liu, Wenkai Wang, Qiang Tian et al. · 0 citations