7 research outputs found
Scalable Kernelization for Maximum Independent Sets
The most efficient algorithms for finding maximum independent sets in both
theory and practice use reduction rules to obtain a much smaller problem
instance called a kernel. The kernel can then be solved quickly using exact or
heuristic algorithms---or by repeatedly kernelizing recursively in the
branch-and-reduce paradigm. It is of critical importance for these algorithms
that kernelization is fast and returns a small kernel. Current algorithms are
either slow but produce a small kernel, or fast and give a large kernel. We
attempt to accomplish both of these goals simultaneously, by giving an
efficient parallel kernelization algorithm based on graph partitioning and
parallel bipartite maximum matching. We combine our parallelization techniques
with two techniques to accelerate kernelization further: dependency checking
that prunes reductions that cannot be applied, and reduction tracking that
allows us to stop kernelization when reductions become less fruitful. Our
algorithm produces kernels that are orders of magnitude smaller than the
fastest kernelization methods, while having a similar execution time.
Furthermore, our algorithm is able to compute kernels with size comparable to
the smallest known kernels, but up to two orders of magnitude faster than
previously possible. Finally, we show that our kernelization algorithm can be
used to accelerate existing state-of-the-art heuristic algorithms, allowing us
to find larger independent sets faster on large real-world networks and
synthetic instances.Comment: Extended versio
Two New Upper Bounds for the Maximum k-plex Problem
A k-plex in a graph is a vertex set where each vertex is non-adjacent to at
most k vertices (including itself) in this set, and the Maximum k-plex Problem
(MKP) is to find the largest k-plex in the graph. MKP is a practical NP-hard
problem, and the k-plex model has many important real-world applications, such
as the analysis of various complex networks. Branch-and-bound (BnB) algorithms
are a type of well-studied and effective exact algorithms for MKP. Recent BnB
MKP algorithms involve two kinds of upper bounds based on graph coloring and
partition, respectively, that work in different perspectives and thus are
complementary with each other. In this paper, we first propose a new
coloring-based upper bound, termed Relaxed Graph Color Bound (RelaxGCB), that
significantly improves the previous coloring-based upper bound. Then we propose
another new upper bound, termed SeesawUB, inspired by the seesaw playing game,
that incorporates RelaxGCB and a partition-based upper bound in a novel way,
making use of their complementarity. We apply RelaxGCB and SeesawUB to
state-of-the-art BnB MKP algorithms and produce four new algorithms. Extensive
experiments show the excellent performance and robustness of the new algorithms
with our proposed upper bounds
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
A graph is weakly -closed if every induced subgraph of
contains one vertex such that for each non-neighbor of it holds
that . The weak closure of a graph,
recently introduced by Fox et al. [SIAM J. Comp. 2020], is the smallest number
such that is weakly -closed. This graph parameter is never larger
than the degeneracy (plus one) and can be significantly smaller. Extending the
work of Fox et al. [SIAM J. Comp. 2020] on clique enumeration, we show that
several problems related to finding dense subgraphs, such as the enumeration of
bicliques and -plexes, are fixed-parameter tractable with respect to
. Moreover, we show that the problem of determining whether a weakly
-closed graph has a subgraph on at least vertices that belongs
to a graph class which is closed under taking subgraphs admits a
kernel with at most vertices. Finally, we provide fixed-parameter
algorithms for Independent Dominating Set and Dominating Clique when
parameterized by where is the solution size.Comment: Appeared in ISAAC '2
K-Connected Cores Computation in Large Dual Networks
© 2018, The Author(s). Computing k- cores is a fundamental and important graph problem, which can be applied in many areas, such as community detection, network visualization, and network topology analysis. Due to the complex relationship between different entities, dual graph widely exists in the applications. A dual graph contains a physical graph and a conceptual graph, both of which have the same vertex set. Given that there exist no previous studies on the k- core in dual graphs, we formulate a k-connected core (k- CCO) model in dual graphs. A k- CCO is a k- core in the conceptual graph, and also connected in the physical graph. Given a dual graph and an integer k, we propose a polynomial time algorithm for computing all k- CCOs. We also propose three algorithms for computing all maximum-connected cores (MCCO), which are the existing k- CCOs such that a (k+ 1) -CCO does not exist. We further study a subgraph search problem, which is computing a k- CCO that contains a set of query vertices. We propose an index-based approach to efficiently answer the query for any given parameter k. We conduct extensive experiments on six real-world datasets and four synthetic datasets. The experimental results demonstrate the effectiveness and efficiency of our proposed algorithms
FPT algorithms for finding near-cliques in c-closed graphs
Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the study of real-world graphs, with applications in community detection, pattern recognition, and clustering. A number of effective backtracking-based heuristics for these problems have emerged from recent empirical work in social network analysis. Given the NP-hardness of variants of clique counting, these results raise a challenge for beyond worst-case analysis of these problems. Inspired by the triadic closure of real-world graphs, Fox et al. (SICOMP 2020) introduced the notion of c-closed graphs and proved that maximal clique enumeration is fixed-parameter tractable with respect to c. In practice, due to noise in data, one wishes to actually discover “near-cliques”, which can be characterized as cliques with a sparse subgraph removed. In this work, we prove that many different kinds of maximal near-cliques can be enumerated in polynomial time (and FPT in c) for c-closed graphs. We study various established notions of such substructures, including k-plexes, complements of bounded-degeneracy and bounded-treewidth graphs. Interestingly, our algorithms follow relatively simple backtracking procedures, analogous to what is done in practice. Our results underscore the significance of the c-closed graph class for theoretical understanding of social network analysis
Fast enumeration of large k-Plexes
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the notion of cliques and are more appropriate in most real cases: while a node of a clique C is connected to all other nodes of C, a node of a k-plex may miss up to k connections. Unfortunately computing all maximal k-plexes is a gruesome task and state-of-the-art algorithms can only process small-size networks. In this paper we propose a new approach for enumerating large k-plexes in networks that speeds up the search by several orders of magnitude, leveraging on (i) methods for strongly reducing the search space and (ii) efficient techniques for the computation of maximal cliques. Several experiments show that our strategy is effective and is able to increase the size of the networks for which the computation of large k-plexes is feasible from a few hundred to several hundred thousand nodes