No article text was recorded for this version.
separator crossing complexity
Version 1 of 112 papers20 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
- Blog: Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
- Blog: Certifying 3-Edge-Connectivity
- Blog: Quasi-4-Connected Components
- Blog: On the Spectral Radius of Minimally 2-(Edge)-Connected Graphs with Given Size
- Blog: Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
- Blog: Certifying 3-Edge-Connectivity
- Blog: Doubly Balanced Connected Graph Partitioning
- Blog: Computing with Tangles
- Blog: Streaming Algorithms for Network Design
- Blog: Tangles and Connectivity in Graphs
- Blog: Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
History & citation
Current · Permanent link
- This direction split from Structural Barriers in High-Order Graph Connectivity (58% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_separator_crossing_complexity_b6791c27,
title = {separator crossing complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/separator-crossing-complexity/rdr_b6791c27b81e4716a0913288cac43402},
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_separator_crossing_complexity_b6791c27_v1,
title = {separator crossing complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/separator-crossing-complexity/rdr_b6791c27b81e4716a0913288cac43402/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}