7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DM2017
A Tight Bound for Shortest Augmenting Paths on Trees
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski +1
The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it…
cs.DS2013★ 7 cited
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
Jakub Łącki, Jakub Oćwieja, Marcin Pilipczuk +2
In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an -vertex graph with positive real edge we…