-
1
-
-
26044471384
-
Parallel algorithms for treewidth two
-
Möhring et al., editors, Lecture Notes in Computer Science. Springer-Verlag. 23rd International Workshop WG '97, to appear
-
Bodlaender, H. and de Fluiter, B. (1997). Parallel algorithms for treewidth two. In Möhring et al., editors, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science. Springer-Verlag. 23rd International Workshop WG '97, to appear.
-
(1997)
Graph-Theoretic Concepts in Computer Science
-
-
Bodlaender, H.1
De Fluiter, B.2
-
2
-
-
84958050293
-
Parallel algorithms with optimal speedup for bounded treewidth
-
Fü1öp, Z. and Gécseg, F., editors, Automata, Languages and Programming, Springer-Verlag. Proceedings of the 22nd International Colloquium ICALP'95
-
Bodlaender, H. L. and Hagerup, T. (1995). Parallel algorithms with optimal speedup for bounded treewidth. In Fü1öp, Z. and Gécseg, F., editors, Automata, Languages and Programming, volume 944 of Lecture Notes in Comp. Sci., pages 268-279. Springer-Verlag. Proceedings of the 22nd International Colloquium ICALP'95.
-
(1995)
Lecture Notes in Comp. Sci.
, vol.944
, pp. 268-279
-
-
Bodlaender, H.L.1
Hagerup, T.2
-
3
-
-
0002173644
-
O jistém prob1ému minimálním
-
In Czech, cited after Tarjan
-
Borůvka, O. (1926). O jistém prob1ému minimálním. Práca Moravské Pří odovědecké Společnosti, 3:37-58. In Czech, cited after Tarjan (1983).
-
(1926)
Práca Moravské Příodovědecké Společnosti
, vol.3
, pp. 37-58
-
-
Borůvka, O.1
-
4
-
-
0031334958
-
A faster deterministic algorithm for minimum spanning trees
-
IEEE, The Institute of Electrical and Electronics Engineers, IEEE Computer Society Press
-
Chazelle, B. (1997). A faster deterministic algorithm for minimum spanning trees. In 38th Annual Symposion On Foundations of Computer Science. IEEE, The Institute of Electrical and Electronics Engineers, IEEE Computer Society Press.
-
(1997)
38th Annual Symposion on Foundations of Computer Science
-
-
Chazelle, B.1
-
5
-
-
0000428085
-
Finding minimum spanning trees
-
Cheriton, D. and Tarjan, R. E. (1976). Finding minimum spanning trees. SIAM J. Computing, 5:724-742.
-
(1976)
SIAM J. Computing
, vol.5
, pp. 724-742
-
-
Cheriton, D.1
Tarjan, R.E.2
-
8
-
-
0001522013
-
Verification and sensitivity analysis of minimum spanning trees in linear time
-
Dixon, B., Ranch, M., and Tarjan, R. E. (1992). Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing, 21(6): 1184-1192.
-
(1992)
SIAM Journal on Computing
, vol.21
, Issue.6
, pp. 1184-1192
-
-
Dixon, B.1
Ranch, M.2
Tarjan, R.E.3
-
9
-
-
0023547501
-
Parallel symmetry-breaking in sparse graphs
-
ACM, Assoc. for Comp. Machinery
-
Goldberg, A. V., Plotkin, S. A., and Shannon, G. E. (1987). Parallel symmetry-breaking in sparse graphs. In Proceedings of the Nineteenth Anual ACM Symposion on Theory of Computing, pages 315-324. ACM, Assoc. for Comp. Machinery.
-
(1987)
Proceedings of the Nineteenth Anual ACM Symposion on Theory of Computing
, pp. 315-324
-
-
Goldberg, A.V.1
Plotkin, S.A.2
Shannon, G.E.3
-
10
-
-
0025248905
-
Optimal parallel algorithms on planar graphs
-
Hagerup, T. (1990). Optimal parallel algorithms on planar graphs. Information and Computation, 84:71-96.
-
(1990)
Information and Computation
, vol.84
, pp. 71-96
-
-
Hagerup, T.1
-
11
-
-
0030393752
-
An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM
-
Halperin, S. and Zwick, U. (1996). An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. J. Comput. System Sci., 53(3):395-416.
-
(1996)
J. Comput. System Sci.
, vol.53
, Issue.3
, pp. 395-416
-
-
Halperin, S.1
Zwick, U.2
-
12
-
-
0029276335
-
A randomized linear-time algorithin to find minimum spanning trees
-
Karger, D. R., Klein, P. N., and Tarjan, R. E. (1995). A randomized linear-time algorithin to find minimum spanning trees. Journal of the ACM, 42(2):321-328.
-
(1995)
Journal of the ACM
, vol.42
, Issue.2
, pp. 321-328
-
-
Karger, D.R.1
Klein, P.N.2
Tarjan, R.E.3
-
13
-
-
0000626504
-
A simpler minimum spanning tree verification algorithm
-
King, V. (1997). A simpler minimum spanning tree verification algorithm. Algorithmica, 18(2):263-270.
-
(1997)
Algorithmica
, vol.18
, Issue.2
, pp. 263-270
-
-
King, V.1
-
15
-
-
0002144725
-
On the minimum of the Hadwiger number for graphs with given mean degree of vertices
-
Kostochka, A. V. (1982). On the minimum of the Hadwiger number for graphs with given mean degree of vertices. Metody Diskretn. Anal., 38:37-58.
-
(1982)
Metody Diskretn. Anal.
, vol.38
, pp. 37-58
-
-
Kostochka, A.V.1
-
16
-
-
0000079797
-
Homomorphieeigenschaften nnd mittlere Kantendichte von Graphen
-
Mader, W. (1967). Homomorphieeigenschaften nnd mittlere Kantendichte von Graphen. Math. Ann., 174:265-268.
-
(1967)
Math. Ann.
, vol.174
, pp. 265-268
-
-
Mader, W.1
-
17
-
-
0012686132
-
A randomized linear work EREW PRAM algorithm to find a minimum spanning tree
-
Jaffar, J. and Leong, H. W., editors, Springer-Verlag. Proceedings of the Eighth Annual International Symposium ISAAC'97, to appear
-
Poon, C. and Ramachandran, V. (1997). A randomized linear work EREW PRAM algorithm to find a minimum spanning tree. In Jaffar, J. and Leong, H. W., editors, Algorithms and Computation. Springer-Verlag. Proceedings of the Eighth Annual International Symposium ISAAC'97, to appear.
-
(1997)
Algorithms and Computation
-
-
Poon, C.1
Ramachandran, V.2
-
18
-
-
0004190201
-
-
Society of Industrial and Applied Mathematics (SIAM), Philadelphia
-
Tarjan, R. E. (1983). Data structures and network algorithms. Society of Industrial and Applied Mathematics (SIAM), Philadelphia.
-
(1983)
Data Structures and Network Algorithms
-
-
Tarjan, R.E.1
-
19
-
-
84976013923
-
An extremal function for contractions of graphs
-
Thomason, A. (1984). An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc., 95:261-265.
-
(1984)
Math. Proc. Cambridge Philos. Soc.
, vol.95
, pp. 261-265
-
-
Thomason, A.1
-
20
-
-
0002260157
-
An O(|E|log log|V|) algorithm for finding minimum spanning trees
-
Yao, A. C.-c. (1975). An O(|E|log log|V|) algorithm for finding minimum spanning trees. Inform. Processing Letters, 4:21-23.
-
(1975)
Inform. Processing Letters
, vol.4
, pp. 21-23
-
-
Yao, A.C.-C.1
|