38 citations · 45 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 38 cited
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connecte…
cs.DS2014
Improved Algorithms for Parity and Streett objectives
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer
The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with ap…