The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive

TL;DR

This paper proves that the Bron-Kerbosch algorithm with vertex ordering is output-sensitive, providing insights into its efficiency for maximal clique enumeration.

Contribution

It establishes that the Bron-Kerbosch algorithm with vertex ordering is output-sensitive, a property previously unknown for this algorithm.

Findings

Proves output sensitivity of Bron-Kerbosch with vertex ordering

Provides theoretical analysis of algorithm efficiency

Builds on prior work by Eppstein, L"offler, and Strash

Abstract

The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, L\"offler and Strash in "Listing all maximal cliques in sparse graphs in near-optimal time. International Symposium on Algorithms and Computation. Springer, Berlin, Heidelberg, 2010" is output sensitive.