scientific article; zbMATH DE number 7561545

DOI10.4230/LIPIcs.ICALP.2019.52MaRDI QIDQ5091207

Dana Ron, Will Rosenbaum, Talya Eden

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1902.08086

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

samplinggraph algorithmsarboricitysublinear-time algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Property testing lower bounds via communication complexity
• Augmenting \(k\)-core generation with preferential attachment
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• Sublinear-time algorithms for counting star subgraphs via edge sampling
• Emergence of Scaling in Random Networks
• Counting Stars and Other Small Subgraphs in Sublinear-Time
• Edge-Disjoint Spanning Trees of Finite Graphs
• Approximating average parameters of graphs
• Bounded Arboricity to Determine the Local Structure of Sparse Graphs
• Approximately Counting Triangles in Sublinear Time
• Testing Bounded Arboricity
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
• Enumerating and Generating Labeled k-degenerate Graphs
• On approximating the number of k-cliques in sublinear time
• On Sampling Edges Almost Uniformly
• On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph

This page was built for publication: