DeepAI AI Chat
Log In Sign Up

A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors

by   Duc Hung Pham, et al.
Indian Institute of Technology Hyderabad
Rice University

The Graph Isomorphism (GI) problem is a theoretically interesting problem because it has not been proven to be in P nor to be NP-complete. Babai made a breakthrough in 2015 when announcing a quasipolynomial time algorithm for GI problem. Babai's work gives the most theoretically efficient algorithm for GI, as well as a strong evidence favoring the idea that class GI NP and thus P NP. Based on Babai's algorithm, we prove that GI can further be solved by a parallel algorithm that runs in polynomial time using a quasipolynomial number of processors. We achieve that result by identifying the bottlenecks in Babai's algorithms and parallelizing them. In particular, we prove that color refinement can be computed in parallel logarithmic time using a polynomial number of processors, and the k-dimensional WL refinement can be computed in parallel polynomial time using a quasipolynomial number of processors. Our work suggests that Graph Isomorphism and GI-complete problems can be computed efficiently in a parallel computer, and provides insights on speeding up parallel GI programs in practice.


page 1

page 2

page 3

page 4


A Polynomial Time Algorithm for a NPC Problem

It is introduced a so called 'Multi-stage graph Simple Path' problem (MS...

On Salum's Algorithm for X3SAT

This is a commentary on, and critique of, Latif Salum's paper titled "Tr...

A new approach for a proof that P is NP

In this paper we propose a new approach for developing a proof that P=NP...

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

In real-time systems, in addition to the functional correctness recurren...

Machines as Programs: P ≠ NP

The Curry-Howard correspondence is often called the proofs-as-programs r...

Towards Work-Efficient Parallel Parameterized Algorithms

Parallel parameterized complexity theory studies how fixed-parameter tra...

On the tractability of the maximum independent set problem

The maximum independent set problem is a classical NP-complete problem i...