446 search results - page 27 / 90 » A fast algorithm for computing steiner edge connectivity |
DATAMINE
1999
14 years 9 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
103
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
152
click to vote
Publication
The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to ...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...