-
1
-
-
0002173644
-
O jistém problému minimálním (about a certain minimal problem)
-
Czech with German summary
-
Borůvka, O., O jistém problému minimálním (About a Certain Minimal Problem), Práce mor. přírodověd. spol. v Brně, III, (1926), 37-58. Czech with German summary.
-
(1926)
Práce Mor. Přírodověd. Spol. V Brně
, vol.3
, pp. 37-58
-
-
Borůvka, O.1
-
2
-
-
0022162576
-
Data structures for on-line updating of minimum spanning trees
-
Frederickson, G. N., Data structures for on-line updating of minimum spanning trees, SIAM J. Comput. 14 (1985), 781-798.
-
(1985)
SIAM J. Comput.
, vol.14
, pp. 781-798
-
-
Frederickson, G.N.1
-
3
-
-
0025550429
-
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
-
Fredman, M. and Willard, D. E., Trans-dichotomous algorithms for minimum spanning trees and shortest paths, In Proceedings of FOCS'90 (1990), 719-725.
-
(1990)
Proceedings of FOCS'90
, pp. 719-725
-
-
Fredman, M.1
Willard, D.E.2
-
4
-
-
0002726668
-
On the history of the minimum spanning tree problem
-
Graham, R. L. and Hell, P., On the history of the minimum spanning tree problem, Ann. Hist. Comput. 7 (1985), 43-57.
-
(1985)
Ann. Hist. Comput.
, vol.7
, pp. 43-57
-
-
Graham, R.L.1
Hell, P.2
-
5
-
-
0012574730
-
A minimum spanning tree algorithm with inverse-ackermann type complexity
-
Chazelle, B., A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity, J. ACM 47 (2000), 1028-1047.
-
(2000)
J. ACM
, vol.47
, pp. 1028-1047
-
-
Chazelle, B.1
-
6
-
-
0029276335
-
Linear expected-time algorithms for connectivity problems
-
Karger, D. R., Klein, P. N. and Tarjan, R. E., Linear expected-time algorithms for connectivity problems, J. ACM 42 (1995), 321-328.
-
(1995)
J. ACM
, vol.42
, pp. 321-328
-
-
Karger, D.R.1
Klein, P.N.2
Tarjan, R.E.3
-
7
-
-
7044232895
-
The Minimum Spanning tree Problem on a Planar Graph
-
Matsui, T., The Minimum Spanning tree Problem on a Planar Graph, Discrete Appl. Math. 58 (1995), 91-94.
-
(1995)
Discrete Appl. Math.
, vol.58
, pp. 91-94
-
-
Matsui, T.1
-
8
-
-
4243159077
-
Some remarks on the history of MST-problem
-
Nešetřil, J., Some remarks on the history of MST-problem, Arch. Math. (Brno) 33 (1997), 15-22.
-
(1997)
Arch. Math. (Brno)
, vol.33
, pp. 15-22
-
-
Nešetřil, J.1
-
10
-
-
0035962186
-
Otakar borůvka on minimum spanning tree problem
-
Nešetřil, J., Milková, E. and Nesetrilová, H., Otakar Borůvka on Minimum Spanning Tree Problem, Discrete Math. 233(1-3) (2001), 3-36.
-
(2001)
Discrete Math.
, vol.233
, Issue.1-3
, pp. 3-36
-
-
Nešetřil, J.1
Milková, E.2
Nesetrilová, H.3
-
11
-
-
4243132048
-
Finding minimum spanning trees in O(mα(m, n)) time
-
Univ. of Texas at Austin
-
Pettie, S., Finding minimum spanning trees in O(mα(m, n)) time, Tech Report TR99-23, Univ. of Texas at Austin, 1999.
-
(1999)
Tech Report
, vol.TR99-23
-
-
Pettie, S.1
-
12
-
-
84974577684
-
An optimal minimum spanning tree algorithm
-
Springer Verlag
-
Pettie, S. and Ramachandran, V., An Optimal Minimum Spanning Tree Algorithm, In Proceedings of ICALP'2000, 49-60, Springer Verlag, 2000.
-
(2000)
Proceedings of ICALP'2000
, pp. 49-60
-
-
Pettie, S.1
Ramachandran, V.2
|
