4 citations · 5 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Vertex Covers Revisited: Indirect Certificates and FPT Algorithms
Leizhen Cai
The classical NP-complete problem Vertex Cover requires us to determine whether a graph contains at most vertices that cover all edges. In spite of its intractability, the prob…
cs.DS2018★ 4 cited
Alternating Path and Coloured Clustering
Leizhen CAI, On Yin LEUNG
In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends…