DeepAI AI Chat
Log In Sign Up

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

by   Tomohiro Koana, et al.
Philipps-Universität Marburg
Berlin Institute of Technology (Technische Universität Berlin)

A graph G is weakly γ-closed if every induced subgraph of G contains one vertex v such that for each non-neighbor u of v it holds that |N(u)∩ N(v)|<γ. The weak closure γ(G) of a graph, recently introduced by Fox et al. [SIAM J. Comp. 2020], is the smallest number such that G 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 s-plexes, are fixed-parameter tractable with respect to γ(G). Moreover, we show that the problem of determining whether a weakly γ-closed graph G has a subgraph on at least k vertices that belongs to a graph class 𝒢 which is closed under taking subgraphs admits a kernel with at most γ k^2 vertices. Finally, we provide fixed-parameter algorithms for Independent Dominating Set and Dominating Clique when parameterized by γ+k where k is the solution size.


page 1

page 2

page 3

page 4


Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs

Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called c-clo...

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...

FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs

Dense subgraph detection is a fundamental problem in network analysis fo...

Exploiting 𝐜-Closure in Kernelization Algorithms for Graph Problems

A graph is c-closed if every pair of vertices with at least c common nei...

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Let ℱ be a family of graphs, and let p,r be nonnegative integers. The (p...

Reconfiguring spanning and induced subgraphs

Subgraph reconfiguration is a family of problems focusing on the reachab...

Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition

Mining dense subgraphs where vertices connect closely with each other is...