Advanced Multilevel Node Separator Algorithms
Peter Sanders, Christian Schulz

TL;DR
This paper presents advanced multilevel algorithms for finding small node separators in large graphs, combining flow-based local search with graph coarsening techniques to improve solution quality significantly.
Contribution
Introduces novel flow-based local search algorithms integrated into a multilevel framework, transferring successful graph partitioning techniques to enhance node separator quality.
Findings
Flow-based local search algorithms are highly competitive.
Adding local search improves separator quality.
Achieves 10% and 62% smaller separators than Metis and Scotch.
Abstract
A node separator of a graph is a subset S of the nodes such that removing S and its incident edges divides the graph into two disconnected components of about equal size. In this work, we introduce novel algorithms to find small node separators in large graphs. With focus on solution quality, we introduce novel flow-based local search algorithms which are integrated in a multilevel framework. In addition, we transfer techniques successfully used in the graph partitioning field. This includes the usage of edge ratings tailored to our problem to guide the graph coarsening algorithm as well as highly localized local search and iterated multilevel cycles to improve solution quality even further. Experiments indicate that flow-based local search algorithms on its own in a multilevel framework are already highly competitive in terms of separator quality. Adding additional local search…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Interconnection Networks and Systems · Caching and Content Delivery
