You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Parameterized Complexity of the k -Arc Chinese Postman Problem
Algorithms - ESA 2014
Springer, Berlin, Heidelberg, September 2014
Gregory Gutin, Mark Jones, Bin Sheng, Gutin, Gregory, Jones, Mark, Sheng, Bin
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||1||50%|
|Readers by discipline||Count||As %|