1 citations · 1 across the 5 of their papers we have counts for
5 papers
When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
Guozhen Rong, Xin Li, Yongjie Yang
Preference restrictions have played a significant role in computational social choice. This paper studies a framework that connects preference restrictions with classical graph sea…
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…
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Guozhen Rong, Wenjun Li, Jianxin Wang +1
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjectu…
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…
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…