单模交问题
The Unimodular Intersection Problem
摘要：
我们发现，找到最小相交的$n$路径从$s$到$t$在有向图或$n$完美匹配在二部图可以在多项式时间内完成。这对于幺模集合系统更一般地成立。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
