The Unimodular Intersection Problem
classification
🧮 math.OC
cs.DMcs.DSmath.CO
keywords
graphunimodularbipartitedirecteddonefindinggenerallyholds
read the original abstract
We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.