Sciweavers

ALGORITHMICA
2010

An Efficient Algorithm for Batch Stability Testing

13 years 3 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different matchings in a batch fashion in O((m + kn) log2 n) time. This affirmatively answers a longstanding open question of Gusfield and Irving as to whether stability can be verified in a batch setting (after sufficient preprocessing) in time sub-quadratic in n.
John Dabney, Brian C. Dean
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2010
Where ALGORITHMICA
Authors John Dabney, Brian C. Dean
Comments (0)