On Finding Dense Common Subgraphs

02/18/2018
by   Moses Charikar, et al.
0

We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices S that maximizes some aggregate measure of the density of the subgraphs induced by S in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recently. We settle many of the questions left open by previous works, showing NP-hardness, hardness of approximation, non-trivial approximation algorithms, and an integrality gap for a natural relaxation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2018

Top-k Overlapping Densest Subgraphs: Approximation and Complexity

A central problem in graph mining is finding dense subgraphs, with sever...
research
03/20/2018

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs

Chordal graphs are the graphs in which every cycle of length at least fo...
research
08/04/2020

Top-k Connected Overlapping Densest Subgraphs in Dual Networks

Networks are largely used for modelling and analysing data and relations...
research
10/19/2022

Community detection in edge-labeled graphs

Finding dense communities in networks is a widely-used tool for analysis...
research
10/12/2020

Counting Subgraphs in Degenerate Graphs

We consider the problem of counting the number of copies of a fixed grap...
research
04/23/2019

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

We study the problem #IndSub(P) of counting all induced subgraphs of siz...
research
02/28/2021

Discovering Dense Correlated Subgraphs in Dynamic Networks

Given a dynamic network, where edges appear and disappear over time, we ...

Please sign up or login with your details

Forgot password? Click here to reset