7 citations · 20 across the 13 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017★ 4 cited
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs
Bin Sheng, Ruijuan Li, Gregory Gutin
The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these resul…
cs.DS2017
An improved kernel for the cycle contraction problem
Bin Sheng, Yuefang Sun
The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contr…