26 citations · 56 across the 9 of their papers we have counts for
9 papers
On well (edge) dominated and equimatchable strong product graphs
Yixin Cao, Guiqiang Mou, Jianxin Wang
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong…
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao +1
Cluster deletion is an NP-hard graph clustering objective with applications in computational biology and social network analysis, where the goal is to delete a minimum number of ed…
Minimum sum vertex cover: kernelization and parameterized algorithms
Yixin Cao, Ling Gai, Jingyi Liu +1
Given an ordering of the vertices of a graph, the cost of covering an edge is the smaller number of its two ends. The minimum sum vertex cover problem asks for an ordering that min…
Constructing Holistic Spatio-Temporal Scene Graph for Video Semantic Role Labeling
Yu Zhao, Hao Fei, Yixin Cao +5
Video Semantic Role Labeling (VidSRL) aims to detect the salient events from given videos, by recognizing the predict-argument event structures and the interrelationships between e…
Take a Break in the Middle: Investigating Subgoals towards Hierarchical Script Generation
Xinze Li, Yixin Cao, Muhao Chen +1
Goal-oriented Script Generation is a new task of generating a list of steps that can fulfill the given goal. In this paper, we propose to extend the task from the perspective of co…
A -Vertex Kernel for Maximum Internal Spanning Tree
Wenjun Li, Jianxin Wang, Jianer Chen +1
We consider the parameterized version of the maximum internal spanning tree problem, which, given an -vertex graph and a parameter , asks for a spanning tree with at least $k…