59 citations
- Kansas State UniversityUS3 papers
- East China Normal UniversityCN2 papers
- Hangzhou Dianzi UniversityCN2 papers
- Nanjing Normal UniversityCN2 papers
- Nanjing University of Science and TechnologyCN2 papers
- Nanyang Technological UniversitySG2 papers
- Shanghai Jiao Tong UniversityCN2 papers
- University of Chinese Academy of SciencesCN2 papers
- Beijing University of Chemical TechnologyCN1 paper
- Central China Normal UniversityCN1 paper
- Chinese Academy of SciencesCN1 paper
- Division of Mathematical SciencesUS1 paper
Showing 2017Show all
2 papers · 1 filter
math.CO2017
On the complexity of k-rainbow cycle colouring problems
Shasha Li, Yongtang Shi, Jianhua Tu +1
An edge-coloured cycle is if all edges of the cycle have distinct colours. For , let denote the family of all graphs with the property that any…
cs.DS2017★ 1 cited
On the NP-hardness of scheduling with time restrictions
An Zhang, Yong Chen, Lin Chen +1
In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer , there is a set of jobs…