No article text was recorded for this version.
recursive graph partitioning
Version 1 of 1313 papers347 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems
- Blog: Gomory-Hu Trees in Quadratic Time
- Blog: Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Blog: Single Source - All Sinks Max Flows in Planar Digraphs
- Blog: Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
- Blog: Multi-constraint graph partitioning problems via recursive bipartition algorithm based on subspace minimization conjugate gradient method
- Blog: Improved Algorithms for One-Pair and k-Pair Streett Objectives
- Blog: Metric Decompositions of Path-Separable Graphs
- Blog: Improved girth approximation in weighted undirected graphs
- Blog: $O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
- Blog: Reconstructing a Bounded-Degree Directed Tree Using Path Queries
- Blog: Optimal parameterized algorithms for planar facility location problems\n using Voronoi diagrams
- Blog: A face cover perspective to $\ell_1$ embeddings of planar graphs
- Blog: A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
- Blog: Faster Cut-Equivalent Trees in Simple Graphs
- Blog: Plane Gossip: Approximating rumor spread in planar graphs
- Blog: Approximate Counting via Correlation Decay on Planar Graphs
- Blog: Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Blog: Efficient Graph Field Integrators Meet Point Clouds
- Blog: Improved Approximations for Relative Survivable Network Design
- Blog: Optimal Approximate Distance Oracle for Planar Graphs
- Blog: An Exponential Time 2-Approximation Algorithm for Bandwidth
- Blog: On Tamaki's Algorithm to Compute Treewidths
- Blog: A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
- Blog: Efficient Approximation for Triangulation of Minimum Treewidth
- Blog: PACE Solver Description: Fluid
- Blog: FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition
- Blog: Graph coloring with no large monochromatic components
- Blog: TSP in a Simple Polygon
- Blog: A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
- Blog: Supporting Very Large Models using Automatic Dataflow Graph Partitioning
- Blog: Deciding first-order properties of nowhere dense graphs
- Blog: Ordering with precedence constraints and budget minimization
- Blog: Efficient Graph Field Integrators Meet Point Clouds
- Blog: A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
- Blog: Exact Algorithms for Clustered Planarity with Linear Saturators
- Blog: Arboricity-Dependent Algorithms for Edge Coloring
- Blog: Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
- Blog: An Exponential Time 2-Approximation Algorithm for Bandwidth
- Blog: Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs
- Blog: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition
- Blog: Hardness and Approximation Algorithms for Balanced Districting Problems
- Blog: Finding a Hidden Edge
- Blog: A Junction Tree Framework for Undirected Graphical Model Selection
- Blog: Fast Algorithms for Graph Arboricity and Related Problems
- Blog: A Generalized Binary Tree Mechanism for Private Approximation of All-Pair Shortest Distances
- Blog: Gomory-Hu Tree in Subcubic Time
- Blog: Edge-Disjoint Paths in Planar Graphs
- Blog: Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance
- Blog: Symbolic Time and Space Tradeoffs for Probabilistic Verification
- Blog: Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
- Blog: Labelling algorithms for paired-domination problems in block and interval graphs
- Blog: On Strong Diameter Padded Decompositions
- Blog: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
- Blog: On the Size of Minimal Separators for Treedepth Decomposition
- Blog: How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
- Blog: Matroid-Based TSP Rounding for Half-Integral Solutions
- Blog: Efficient Õ(n/ε) Spectral Sketches for the Laplacian and its Pseudoinverse
- Blog: Sequence graphs: characterization and counting of admissible elements
- Blog: Hypergraph k-cut for fixed k in deterministic polynomial time
Showing 60 of 313 papers.
History & citation
Current · Permanent link
- Recursive Partitioning for Graph Algorithms merged into this direction (79% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_recursive_graph_partitioning_c30febe5,
title = {recursive graph partitioning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-graph-partitioning/rdr_c30febe502f047dda9048b6b49760446},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_recursive_graph_partitioning_c30febe5_v1,
title = {recursive graph partitioning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-graph-partitioning/rdr_c30febe502f047dda9048b6b49760446/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}