Listing Maximal Subgraphs in Strongly Accessible Set Systems

03/09/2018
by   Alessio Conte, et al.
0

Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an indicator F, subset of 2^U, of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover a large class of set systems, preserving at the same time the efficiency of the enumeration. Among the existing algorithms, the best-known ones list the maximal subsets in time proportional to their number but may require exponential space. In this paper we improve the state of the art in two directions by introducing an algorithmic framework that, under standard suitable conditions, simultaneously (i) extends the class of problems that can be solved efficiently to strongly accessible set systems, and (ii) reduces the additional space usage from exponential in |U| to stateless, thus accounting for just O(q) space, where q <= |U| is the largest size of a maximal set in F

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2019

Proximity Search For Maximal Subgraph Enumeration

This paper considers the subgraphs of an input graph that satisfy a give...
research
07/02/2020

Efficient enumeration of maximal split subgraphs and sub-cographs and related classes

In this paper, we are interested in algorithms that take in input an arb...
research
07/14/2023

Sparse induced subgraphs in P_6-free graphs

We prove that a number of computational problems that ask for the larges...
research
06/04/2021

Maximal antichains of subsets II: Constructions

This is the second in a sequence of three papers investigating the quest...
research
12/23/2019

Potential Maximal Cliques Parameterized by Edge Clique Cover

We show that the number of minimal separators on graphs with edge clique...
research
02/14/2023

Sizes of flat maximal antichains of subsets

This is the second of two papers investigating for which positive intege...
research
07/08/2020

An Efficient Updation Approach for Enumerating Maximal (Δ, γ)Cliques of a Temporal Network

Given a temporal network 𝒢(𝒱, ℰ, 𝒯), (𝒳,[t_a,t_b]) (where 𝒳⊆𝒱(𝒢) and [t_...

Please sign up or login with your details

Forgot password? Click here to reset