The development of the Simula languages - download pdf or read online

By Nygaard K.

Show description

Read or Download The development of the Simula languages PDF

Best graph theory books

Graph Theory and Applications: With Exercises and Problems by Jean-Claude Fournier PDF

Content material: bankruptcy 1 simple suggestions (pages 21–43): bankruptcy 2 bushes (pages 45–69): bankruptcy three colorations (pages 71–82): bankruptcy four Directed Graphs (pages 83–96): bankruptcy five seek Algorithms (pages 97–118): bankruptcy 6 optimum Paths (pages 119–147): bankruptcy 7 Matchings (pages 149–172): bankruptcy eight Flows (pages 173–195): bankruptcy nine Euler excursions (pages 197–213): bankruptcy 10 Hamilton Cycles (pages 26–236): bankruptcy eleven Planar Representations (pages 237–245): bankruptcy 12 issues of reviews (pages 247–259): bankruptcy A Expression of Algorithms (pages 261–265): bankruptcy B Bases of Complexity idea (pages 267–276):

New PDF release: Theory and Application of Graphs

Within the spectrum of arithmetic, graph concept which experiences a mathe­ matical constitution on a collection of parts with a binary relation, as a well-known self-discipline, is a relative newcomer. In fresh 3 many years the fascinating and swiftly turning out to be region of the topic abounds with new mathematical devel­ opments and demanding functions to real-world difficulties.

Extra resources for The development of the Simula languages

Sample text

20. D. Goldschmidt, “Automorphisms of trivalent graphs,” Ann. Math. 111 (1980), 377–406. 21. D. Gorenstein, Finite Groups, Harper and Row, New York, 1968. 22. D. Gorenstein, Finite Simple Groups: An Introduction To Their Classification, Plenum Press, New York, 1982. 23. L. W. Tucker, Topological Graph Theory, Wiley–Interscience, New York, 1987. 24. E. A. Ivanov, Biprimitive cubic graphs, Investigations in Algebraic Theory of Combinatorial Objects (Proceedings of the seminar, Institute for System Studies, Moscow, 1985) Kluwer Academic Publishers, London, 1994, pp 459–472.

Graph Theory 35 (2000), 1–7. 35. D. Maruˇsiˇc and P. Potoˇcnik, “Semisymmetry of generalized Folkman graphs,” European J. Combin. 22 (2001), 333–349. ˇ 36. M. Skoviera, “A contribution to the theory of voltage graphs,” Discrete Math. 61 (1986), 281–292. 37. T. Tutte, “A family of cubical graphs,” Proc. Cambridge Phil. Soc. 43 (1948), 459–474. 38. H. Wielandt, Finite Permutation Groups, Academic Press, New York-London, 1964. 39. E. Wilson, “A worthy family of semisymmetric graphs”, DiscreteMath.

30. A. Malniˇc, D. Maruˇsiˇc, P. Q. Wang, “An infinite family of cubic edge- but not vertextransitive graphs”, Discrete Mathematics 280 (2004), 133–148. 31. A. Malniˇc, D. Maruˇsiˇc and P. Potoˇcnik, “Elementary abelian covers of graphs”, J. Algebraic Combinatorics 20 (2004), 71–97. ˇ 32. A. Malniˇc, R. Nedela, and M. Skoviera, “Lifting graph automorphisms by voltage assignments,” European J. Combin. 21 (2000), 927–947. 33. D. Maruˇsiˇc, “Constructing cubic edge- but not vertex-transitive graphs,” J.

Download PDF sample

The development of the Simula languages by Nygaard K.

by Kevin

Rated 4.39 of 5 – based on 50 votes