Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Question about parallel/distributed solutions for MCE #4

Open
viniciusvdias opened this issue Aug 29, 2018 · 1 comment
Open

Question about parallel/distributed solutions for MCE #4

viniciusvdias opened this issue Aug 29, 2018 · 1 comment

Comments

@viniciusvdias
Copy link

Hi,

Do you know any parallel/distributed implementations for MCE?
It seems to me that the dependency among recursion calls imposes several performance issues in a parallel scenario, for example, in order to maintain the work balanced.

What is your take on that?

Great work by the way.

Cheers,

@darrenstrash
Copy link
Owner

Hey!

There's been quite a bit of work on parallel enumeration algorithms. The most recent I'm aware of is this paper (which has not yet been published):

Shared-Memory Parallel Maximal Clique Enumeration
by Apurba Das, Seyed-Vahid Sanei-Mehri, and Srikanta Tirthapura
https://export.arxiv.org/pdf/1807.09417.pdf

They reference some of the earlier works in the area. The upshot is that parallelizing the algorithm by Tomita et al works pretty well, and things can be done to improve it beyond that.

Best,
Darren

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants