Optimality conjecture for serial and parallel clique-complex construction algorithms
Statement
Let be a graph and let be a nonnegative integer. Consider the serial algorithm and parallel algorithm for constructing the -skeleta of the clique complex of described in the paper. Optimality conjecture. These algorithms are optimal serial and parallel algorithms, respectively, for constructing the -skeleta of the clique complex of a graph. The exact notion of optimality is left open: it may refer to worst-case complexity, average complexity for particular random graph models, or practical performance on real examples.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.