3 citations · 14 across the 18 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DM2023
Planar graphs are acyclically edge -colorable
Qiaojun Shu, Guohui Lin
An edge coloring of a graph is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least…
cs.DS2023
Randomized algorithms for fully online multiprocessor scheduling with testing
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1
We contribute the first randomized algorithm that is an integration of arbitrarily many deterministic algorithms for the fully online multiprocessor scheduling with testing problem…
cs.DS2023
An Approximation Algorithm for Covering Vertices by 4^+-Paths
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1
This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of v…