This paper has been withdrawn by George Manoussakis
No PDF available, click to view other formats
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öffler 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.
From: George Manoussakis [view email]
[v1]
Tue, 5 Nov 2019 17:21:28 UTC (13 KB)
[v2]
Thu, 21 Nov 2019 16:03:22 UTC (1 KB) (withdrawn)
[v3]
Fri, 9 Feb 2024 20:38:02 UTC (1 KB) (withdrawn)
[v4]
Tue, 1 Sep 2026 19:19:56 UTC (1 KB) (withdrawn)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。