A lower bound on the average size of a connected vertex set of a graph.
Andrew VincePublished in: J. Comb. Theory, Ser. B (2022)
Keyphrases
- vertex set
- lower bound
- weighted graph
- upper bound
- standard deviation
- connected components
- undirected graph
- constant factor
- branch and bound algorithm
- random graphs
- branch and bound
- optimal solution
- maximum clique
- worst case
- objective function
- maximum distance
- random walk
- probabilistic model
- path length
- np hard
- maximal cliques
- computational complexity