Algorithms for the Balanced Edge Partitioning Problem

DOI10.1007/978-3-540-72845-0_24MaRDI QIDQ5432325zbMATH OpenOpenAlexFDO

Authors Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_24

zbMATH Keywords

balanced graph partitioninggraph partitioningheuristicsKernighan-Lin heuristic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Improved approximation algorithms for balanced partitioning problems
• Partitioning graphs into balanced components
• Multiply balanced k-partitioning
• Balanced partitions of trees and applications
• Distributed balanced partitioning via linear embedding

Cited in

(10)

• Online balanced repartitioning
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• Distributed balanced partitioning via linear embedding
• scientific article; zbMATH DE number 3983202 (Why is no real title available?)
• A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
• Dynamic balanced graph partitioning
• Scalable edge partitioning
• Streaming balanced graph partitioning algorithms for random graphs
• On evaluating graph partitioning algorithms for distributed agent based models on networks
• Approximation algorithm for the balanced 2-connected k-partition problem

This page was built for publication: Algorithms for the Balanced Edge Partitioning Problem

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