Pith. sign in

REVIEW 1 cited by

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1505.04969 v1 pith:AU3ZEPA4 submitted 2015-05-19 cs.CC

N. Bourgeois , R. Catellier , T. Denat , V. Th. Paschos This is my paper · ORCID
classification cs.CC
keywords modelrandomaverage-casebranch-and-boundcomplexityindependentmathcalmaximum
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study average-case complexity of branch-and-bound for maximum independent set in random graphs under the $\mathcal{G}(n,p)$ distribution. In this model every pair $(u,v)$ of vertices belongs to $E$ with probability $p$ independently on the existence of any other edge. We make a precise case analysis, providing phase transitions between subexponential and exponential complexities depending on the probability $p$ of the random model.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph k-Coloring in Average Sublinear Time

    cs.DS 2026-07 conditional novelty 8.0 of 10

    The exact average-case complexity of k-coloring random k-colorable graphs is Θ(nk) for every k ≤ n^{1/37}.

Pith tools