Computing Ultrabubbles in Linear Time by Reduction to Weak Superbubbles in the Double Covering Graph
cs.DS
Submitted: 2026-05-13
Updated: 2026-11-05
Terminology
Sources
- Bidirected Graphs I: Signed General Kotzig-Lov'asz Decomposition
- Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
- Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
- Ultrabubble enumeration via a lowest common ancestor approach
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles