Geodesic halfspace separation is polynomial-time solvable on weakly bridged graphs, pseudo-modular graphs, and matroid basis graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Halfspace separation in geodesic convexity
Geodesic halfspace separation is polynomial-time solvable on weakly bridged graphs, pseudo-modular graphs, and matroid basis graphs.