☆
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…
☆
Hardness of Easy Problems: Basing Hardness onPopular Conjectures such as the StrongExponential Time Hypothesis

Comments:

Read the paper, add your comments…
☆
HyperANF: Approximating the Neighbourhood Function ofVery Large Graphs on a Budget

Comments:

Read the paper, add your comments…
☆
Why Is Maximum Clique Often Easy in Practice?

Comments:

- Open source implementation of the proposed algorithm: https://github.com/jwalteros/dOmega - Related question: [stackexchange](https://cstheory.stackexchange.com/questions/47947/linear-time-algorithm-to-test-if-clique-number-equals-degeneracy-bound)
Maximimi at 2020-12-30 23:05:01
Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42