Distributed dense subgraph detection and low outdegree orientation
From MaRDI portal
Publication:6535012
Recommendations
Cites work
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 2185626 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- A simple greedy algorithm for dynamic graph orientation
- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
- Complexity of network synchronization
- Decomposition of Finite Graphs Into Forests
- Dense subgraphs on dynamic networks
- Densest subgraph in dynamic graph streams
- Distributed approximate maximum matching in the CONGEST model
- Distributed degree splitting, edge coloring, and orientations
- Efficient primal-dual graph algorithms for MapReduce
- Forests, frames, and games: Algorithms for matroid sums and applications
- Fully-dynamic min-cut
- Improved deterministic distributed matching via rounding
- Improved distributed degree splitting and edge coloring
- Low diameter graph decompositions
- Maintaining assignments online: matching, scheduling, and flows
- Near-optimal fully dynamic densest subgraph
- On Finding Dense Subgraphs
- Orienting fully dynamic graphs with worst-case time bounds
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The multiplicative weights update method: a meta-algorithm and applications
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)
