Parallel graph processing is a fundamental and well-studied topic, both theoretically and practically. However, some applications, such as social network analysis and compilers, require these algorithms to be online and, thus, concurrent. This project aims to build practically efficient concurrent algorithms for different aspects of graph processing, including using multi-queues as priority schedulers for some algorithms and online dynamic connectivity problems under edge insertion and deletions.