2 papers
cs.DM2019
Small Connected Planar Graph with 1-Cop-Move Number 4
Wei Quan Lim
This paper describes a 720-vertex connected planar graph G such that cop1(G), denoting the minimum number of cops needed to catch the robber in the 1-cop-move game on G, is at leas…
cs.DS2019
Optimal Multithreaded Batch-Parallel 2-3 Trees
Wei Quan Lim
This paper presents a batch-parallel 2-3 tree T in an asynchronous dynamic multithreading model that supports searches, insertions and deletions in sorted batches and has essential…