Distributed dense subgraph detection and low outdegree orientation
From MaRDI portal
Publication:6535012
DOI10.4230/LIPICS.DISC.2020.15zbMATH Open1543.68301MaRDI QIDQ6535012
Publication date: 2 November 2023
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Density (toughness, etc.) (05C42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fully-dynamic min-cut
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- Forests, frames, and games: Algorithms for matroid sums and applications
- Low diameter graph decompositions
- A simple greedy algorithm for dynamic graph orientation
- Improved deterministic distributed matching via rounding
- Improved distributed degree splitting and edge coloring
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Efficient Primal-Dual Graph Algorithms for MapReduce
- Densest Subgraph in Dynamic Graph Streams
- On Finding Dense Subgraphs
- Complexity of network synchronization
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Distributed Degree Splitting, Edge Coloring, and Orientations
- A Fast Parametric Maximum Flow Algorithm and Applications
- Dense Subgraphs on Dynamic Networks
- Distributed Approximate Maximum Matching in the CONGEST Model.
- Near-optimal fully dynamic densest subgraph
- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
- Maintaining Assignments Online: Matching, Scheduling, and Flows
- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
- Decomposition of Finite Graphs Into Forests
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)
