2 search results - page 1 / 1 » Efficient Edge Splitting-Off Algorithms Maintaining All-Pair... |
96
Voted
IPCO
2010
15 years 4 months ago
2010
122
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...