A dynamic algorithm for maintaining graph partitions

DOI10.1007/3-540-44985-X_8MaRDI QIDQ2721969zbMATH OpenFDO

Authors Lyudmil Aleksandrov, Hristo N. Djidjev

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44985-X_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A completely dynamic algorithm for split graphs
• An algorithm for improving graph partitions
• scientific article; zbMATH DE number 2131658
• Dynamic balanced graph partitioning
• An exact algorithm for graph partitioning
• Graph partitioning: an updated survey
• Dynamically maintaining split graphs
• A computational study of graph partitioning
• A linear time algorithm for graph partition problems
• scientific article; zbMATH DE number 5761786

Cited in

(6)

• Succinct and Implicit Data Structures for Computational Geometry
• A dynamic separator algorithm
• Dynamic balanced graph partitioning
• A novel graph-based partitioning algorithm for large-scale dynamical systems
• Efficient game theoretic approach to dynamic graph partitioning
• Generalized core maintenance of dynamic bipartite graphs

This page was built for publication: A dynamic algorithm for maintaining graph partitions

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