Brief announcement

DOI10.1145/2332432.2332474MaRDI QIDQ5891981zbMATHOpenAlexFDO

Authors Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan

Publication date 5 December 2014

Published in Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2332432.2332474

zbMATH Keywords

aggregationestimationdynamic networksgraph densitysubgraph densitydistributednetworks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Density (toughness, etc.) (05C42) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Dense subgraphs on dynamic networks
• Densest subgraph in dynamic graph streams
• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
• Near-optimal fully dynamic densest subgraph
• Dynamic detection of subgraphs in computer networks
• Embedding large subgraphs into dense graphs
• On Finding Dense Subgraphs

Cited in

(2)

• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
• Dense subgraphs on dynamic networks

This page was built for publication: Brief announcement

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