Speeding-up Graph Algorithms via Clique Partitioning

Akshar Chavan, Sanaz Rabinia, Daniel Grosu +1

Reducing the running time of graph algorithms is vital for tackling real-world problems such as shortest paths and matching in large-scale graphs, where path information plays a cr…