No article text was recorded for this version.
planar duality transformation
Version 1 of 122 papers29 conceptsfrozen 2026-10-04
Papers in this version
- Blog: LP Relaxation and Tree Packing for Minimum k-Cut
- Blog: On the Connectivity Preserving Minimum Cut Problem
- Blog: LP Relaxation and Tree Packing for Minimum k-cuts
- Blog: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
- Blog: Predicting Nearly as well as the best Pruning of a Planar Decision Graph
- Blog: A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
- Blog: Single Source - All Sinks Max Flows in Planar Digraphs
- Blog: Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Blog: Graph Connectivity with Noisy Queries
- Blog: Scheduling Conservation Designs for Maximum Flexibility via Network Cascade Optimization
- Blog: Boundary-to-boundary flows in planar graphs
- Blog: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.
- Blog: Mimicking Networks and Succinct Representations of Terminal Cuts
- Blog: Refined Vertex Sparsifiers of Planar Graphs
- Blog: Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
- Blog: Acyclic Subgraphs of Planar Digraphs
- Blog: Optimal Decremental Connectivity in Planar Graphs
- Blog: A New Framework for Approximate Labeling via Graph Cuts
- Blog: Minimum s-t cut in undirected planar graphs when the source and the sink are close
- Blog: New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut
- Blog: Guarding Quadrangulations and Stacked Triangulations with Edges
- Blog: Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
History & citation
Current · Permanent link
- This direction split from Planar Duality and the Geometry of Graph Cuts (59% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_planar_duality_transformation_7a64b9b3,
title = {planar duality transformation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/planar-duality-transformation/rdr_7a64b9b3242e499ba60fd67c5d223f9b},
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_planar_duality_transformation_7a64b9b3_v1,
title = {planar duality transformation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/planar-duality-transformation/rdr_7a64b9b3242e499ba60fd67c5d223f9b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}