Distributed dense subgraph detection and low outdegree orientation

DOI10.4230/LIPICS.DISC.2020.15zbMATH Open1543.68301MaRDI QIDQ6535012FDOQ6535012

Authors: Hsin-Hao Su, Hoa T. Vu 

Publication date: 2 November 2023

Recommendations

• Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
• Dense subgraphs on dynamic networks
• On Finding Dense Subgraphs
• Finding Dense Subgraphs with Size Bounds
• Densest subgraph in dynamic graph streams

zbMATH Keywords

distributed algorithmsnetwork algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Density (toughness, etc.) (05C42) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• On Finding Dense Subgraphs
• Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
• Decomposition of Finite Graphs Into Forests
• Forests, frames, and games: Algorithms for matroid sums and applications
• Complexity of network synchronization
• A Fast Parametric Maximum Flow Algorithm and Applications
• The multiplicative weights update method: a meta-algorithm and applications
• Low diameter graph decompositions
• Title not available (Why is that?)
• Maintaining assignments online: matching, scheduling, and flows
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• Title not available (Why is that?)
• Fully-dynamic min-cut
• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
• Densest subgraph in dynamic graph streams
• Distributed degree splitting, edge coloring, and orientations
• A simple greedy algorithm for dynamic graph orientation
• Orienting fully dynamic graphs with worst-case time bounds
• Improved deterministic distributed matching via rounding
• Improved distributed degree splitting and edge coloring
• Efficient primal-dual graph algorithms for MapReduce
• Near-optimal fully dynamic densest subgraph
• Dense subgraphs on dynamic networks
• Distributed approximate maximum matching in the CONGEST model

This page was built for publication: Distributed dense subgraph detection and low outdegree orientation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535012)