The Unimodular Intersection Problem
Optimization and Control
2015-10-05 v3 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Abstract
We show that finding minimally intersecting paths from to in a directed graph or perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
Cite
@article{arxiv.1502.04301,
title = {The Unimodular Intersection Problem},
author = {Volker Kaibel and Shmuel Onn and Pauline Sarrabezolles},
journal= {arXiv preprint arXiv:1502.04301},
year = {2015}
}