Papers added during the last 30 days

Title Added By Date Discussion
Compact structure for sparse undirected graphs based on aclique graph partition IoannisPan Friday 08 Jan
efficient maximum clique computation and enumeration over large sparse graphs IoannisPan Tuesday 05 Jan 💬
Hardness of Easy Problems: Basing Hardness onPopular Conjectures such as the StrongExponential Time Hypothesis Maximimi Thursday 31 Dec
HyperANF: Approximating the Neighbourhood Function ofVery Large Graphs on a Budget Maximimi Thursday 31 Dec
Why Is Maximum Clique Often Easy in Practice? Maximimi Wednesday 30 Dec 💬