AI Chat AI Image Generator AI Video Text to Speech

Linear Work Generation of R-MAT Graphs

05/09/2019

∙

by Lorenz Hübschle-Schneider, et al.

∙

∙

R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful by reducing the required work per edge from logarithmic to constant. The algorithm works in an embarrassingly parallel way.

Lorenz Hübschle-Schneider
7 publications
Peter Sanders
53 publications

page 1

page 2

page 3

page 4

research

∙ 02/13/2018

A Faster Isomorphism Test for Graphs of Small Degree

Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...

0 Martin Grohe, et al. ∙

research

∙ 02/27/2017

Bayesian inference on random simple graphs with power law degree distributions

We present a model for random simple graphs with a degree distribution t...

0 Juho Lee, et al. ∙

research

∙ 10/01/2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs

We study the long-standing open problem of efficiently testing rectiline...

0 Walter Didimo, et al. ∙

research

∙ 10/03/2018

A Bayesian model for sparse graphs with flexible degree distribution and overlapping community structure

We consider a non-projective class of inhomogeneous random graph models ...

0 Juho Lee, et al. ∙

research

∙ 07/19/2023

Dynamic constant time parallel graph algorithms with sub-linear work

The paper proposes dynamic parallel algorithms for connectivity and bipa...

0 Jonas Schmidt, et al. ∙

research

∙ 02/23/2021

The Power of D-hops in Matching Power-Law Graphs

This paper studies seeded graph matching for power-law graphs. Assume th...

0 Liren Yu, et al. ∙

research

∙ 02/03/2022

Misspecification Tests on Models of Random Graphs

A class of models that have been widely used are the exponential random ...

0 Denise Duarte, et al. ∙