Distributed Subgraph Finding: Progress and Challenges

03/13/2022
by   Keren Censor-Hillel, et al.
0

This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of distributed computing, and states intriguing open questions. This version contains some updates over the ICALP 2021 version, and I will try to keep updating it as additional progress is made.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

The Densest k Subgraph Problem in b-Outerplanar Graphs

We give an exact O(nk^2) algorithm for finding the densest k subgraph in...
research
08/08/2018

Strong Subgraph Connectivity of Digraphs: A Survey

In this survey we overview known results on the strong subgraph k-connec...
research
08/25/2020

An update on Weihrauch complexity, and some open questions

This is an informal survey of progress in Weihrauch complexity (cf arXiv...
research
03/25/2023

A Survey on the Densest Subgraph Problem and its Variants

The Densest Subgraph Problem requires to find, in a given graph, a subse...
research
05/05/2022

Streaming and Sketching Complexity of CSPs: A survey

In this survey we describe progress over the last decade or so in unders...
research
07/29/2019

Distributed Dense Subgraph Detection and Low Outdegree Orientation

The maximum density subgraph problem, introduced in the 80s by Picard an...
research
06/27/2019

A Survey and Experimental Analysis of Distributed Subgraph Matching

Recently there emerge many distributed algorithms that aim at solving su...

Please sign up or login with your details

Forgot password? Click here to reset