ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let kk be a nonnegative integer. Consider the serial algorithm and parallel algorithm for constructing the kk-skeleta of the clique complex of GG described in the paper. Optimality conjecture. These algorithms are optimal serial and parallel algorithms, respectively, for constructing the kk-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.