21 search results - page 5 / 5 » podc 2005 |
PODC
2005
ACM
13 years 10 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...