1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs
Guozhen Rong, Yongjie Yang, Wenjun Li
We study the partial search order problem (PSOP) proposed recently by Scheffler [WG 2022]. Given a graph together with a partial order over the set of vertices of , this pro…
cs.DS2019
Characterization and Linear-time Recognition of Paired Threshold Graphs
Guozhen Rong, Yixin Cao, Jianxin Wang
In a paired threshold graph, each vertex has a weight, and two vertices are adjacent if their weight sum is large enough and their weight difference is small enough. It generalizes…
cs.DS2019
Graph Searches and Their End Vertices
Yixin Cao, Guozhen Rong, Jianxin Wang +1
Graph search, the process of visiting vertices in a graph in a specific order, has demonstrated magical powers in many important algorithms. But a systematic study was only initiat…