-
3
-
-
0039231306
-
On the average performance of the greedy algorithm for finding a matching in a graph
-
Dyer, M. E., Frieze, A. M., and Pittbl, B. 1993. On the average performance of the greedy algorithm for finding a matching in a graph. Ann. Appl. Probab. 3, 526-552.
-
(1993)
Ann. Appl. Probab.
, vol.3
, pp. 526-552
-
-
Dyer, M.E.1
Frieze, A.M.2
Pittbl, B.3
-
4
-
-
0000927535
-
Paths, tress, and flowers
-
Edmonds, J. 1965. Paths, tress, and flowers. Canad. J. Math. 17, 449-467.
-
(1965)
Canad. J. Math.
, vol.17
, pp. 449-467
-
-
Edmonds, J.1
-
5
-
-
0027146872
-
Analysis of a simple greedy matching algorithm on cubic random graphs
-
(1993)
-
Frieze, A. M., Radclippb, A. J., and Suen, S. 1993. Analysis of a simple greedy matching algorithm on cubic random graphs. Volume 4 of Proc. Fourth. Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 341-351.
-
(1993)
Proc. Fourth. Annual ACM-SIAM Symposium on Discrete Algorithms
, vol.4
, pp. 341-351
-
-
Frieze, A.M.1
Radclippb, A.J.2
Suen, S.3
-
6
-
-
0016943409
-
An efficient implementation of Edmonds’maximum matching algorithm
-
Gabow, H. 1976. An efficient implementation of Edmonds’maximum matching algorithm. J. ACM 23, 221-234.
-
(1976)
J. ACM
, vol.23
, pp. 221-234
-
-
Gabow, H.1
-
7
-
-
0020921596
-
A linear time algorithm for a special case of disjoint set union.
-
(Boston, 1983)
-
Gabow, H. and Tarjan, R. 1983. A linear time algorithm for a special case of disjoint set union. Volume 15 of Proc. of the Ann. ACM Symp. Theory of Computing (Boston, 1983), pp. 246-251.
-
(1983)
Proc. of the Ann. ACM Symp. Theory of Computing
, vol.15
, pp. 246-251
-
-
Gabow, H.1
Tarjan, R.2
-
8
-
-
0347206156
-
A fast perfect-matching algorithm in random graphs
-
Goldschmidt, O. and Hochbaum, D. S. 1990. A fast perfect-matching algorithm in random graphs. SIAM J. Discrete Math. 3, 48-57.
-
(1990)
SIAM J. Discrete Math.
, vol.3
, pp. 48-57
-
-
Goldschmidt, O.1
Hochbaum, D.S.2
-
9
-
-
84963056434
-
On representatives of subsets
-
Hall, P. 1935. On representatives of subsets. J. London. Math. Soc. 10, 26-30.
-
(1935)
J. London. Math. Soc.
, vol.10
, pp. 26-30
-
-
Hall, P.1
-
13
-
-
0029184961
-
Leda: A platform for combinatorial and geometric computing
-
Mehlhorn, K. and näher, S. 1995. Leda: A platform for combinatorial and geometric computing. Communications of the ACM 38, 96-102.
-
(1995)
Communications of the ACM
, vol.38
, pp. 96-102
-
-
Mehlhorn, K.1
näher, S.2
-
14
-
-
85024261581
-
-
Leda version 3.4-R source code, module _mc_matching.cc
-
Mbhlhorn, K., Näher, S., and Uhrig, S. 1996. Leda version 3.4-R source code, module _mc_matching.cc.
-
(1996)
-
-
Mbhlhorn, K.1
Näher, S.2
Uhrig, S.3
-
15
-
-
85064850083
-
An [formula omitted] algorithm for finding maximum matching in general graphs.
-
(Syracuse, 1980)
-
Micali, S. and Vazirani, V. 1980. An [formula omitted] algorithm for finding maximum matching in general graphs. Volume 21 of Proc. of the Ann. IEEE Symp. Foundations of Computer Science (Syracuse, 1980), pp. 17-25.
-
(1980)
Proc. of the Ann. IEEE Symp. Foundations of Computer Science
, vol.21
, pp. 17-25
-
-
Micali, S.1
Vazirani, V.2
-
17
-
-
0042637508
-
A probabilistic analysis of some greedy cardinality matching algorithms
-
Tinhoper, G. 1984. A probabilistic analysis of some greedy cardinality matching algorithms. Annals of Oper. Res. 1, 239-254.
-
(1984)
Annals of Oper. Res.
, vol.1
, pp. 239-254
-
-
Tinhoper, G.1
|