Wellcome to IoannisPan's library,

  You can find here all papers liked or uploaded by IoannisPan
  together with brief user bio and description of her/his academic activity.

...Some information about the user will someday appear here...
☆
Multi-core spanning forest algorithms using the disjoint-set data structure

Comments:

Nice paper! Very clear and useful!! I do not see absolute time values in the experiments, just speedups. It would have been nice to show some absolute values too. I've implemented the algorithms [here](https://github.com/maxdan94/ParallelUnionFind). On a very large graphs with more than 10 billions of edges (the twitter graph [here](https://sites.google.com/view/limass/datasets)), I observe that the verification algorithm is faster and leads to better speedups than the lock algorithm.
Maximimi at 2021-03-08 11:24:06
Read the paper, add your comments…
☆
Compact structure for sparse undirected graphs based on aclique graph partition

Comments:

Read the paper, add your comments…
☆
efficient maximum clique computation and enumeration over large sparse graphs

Comments:

full version here : https://link.springer.com/article/10.1007%2Fs00778-020-00602-z including results with parallelization
IoannisPan at 2021-01-05 16:56:44
Read the paper, add your comments…
Pages: 1