Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.
citing papers explorer
-
From Frames to Features: Scalable Zigzag Persistence for Binary Video
A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.