13 citations · 19 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
Satoru Iwata, Yu Yokoi
Let be a multigraph with a set of terminals. A path in is called a -path if its ends are distinct vertices in and no internal vertices belong to…
cs.DS2019
A Weighted Linear Matroid Parity Algorithm
Satoru Iwata, Yusuke Kobayashi
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential…