The graph theory approach to analyze critical infrastructures of transportation systems

• Autorzy: Guze S.
• Języki publikacji: EN

Abstrakty

EN

The main aim of the paper is to use algorithms and parameters of graph theory as tool to analyze the transpiration systems. To realize this goal the well-known information about graph theory algorithms and parameters will be introduced and described. The possible application of graph theory algorithms and parameters to analyze the critical infrastructures of exemplary transportation system will be shown.

Słowa kluczowe

EN

critical infrastructures; domination set; domination number; minimal spanning tree

• Wydawca: Polskie Towarzystwo Bezpieczeństwa i Niezawodności
• Czasopismo: Journal of Polish Safety and Reliability Association
• Rocznik: 2014
• Tom: Vol. 5, No. 2
• Strony: 57--62
• Opis fizyczny: Bibliogr. 8 poz., rys, tab., wykr.

Twórcy

autor

Guze S.

• Gdynia Maritime University, Poland

Bibliografia

• [1] COMMISSION OF THE EUROPEAN COMMUNITIES (2006), Communication from the Commission on a European Programme for Critical Infrastructure Protection, Brussels.
• [2] Cormen, T.H. & al. (2009). Introduction to Algorithms. Third Edition. MIT Press, ISBN 0262-03384-4. Section 23.2: The algorithms of Kruskal and Prim, pp. 631–638.
• [3] Fink, J.F. et. al. (1990). The bondage number of a graph. Discrete Math., 86 (1990), pp. 47–57.
• [4] Harary, F. (1969). Graph Theory. AddisonWesley, Reading.
• [5] Haynes T. W., Hedetniemi, S., Slater, P. (1988). Fundamentals of Domination in Graphs. CRC Press.
• [6] Kołowrocki, K. (2013). Safety of critical infrastructures. Journal of Polish Safety and Reliability Association, Summer Safety and Reliability Seminars. Vol. 4, No. 1, pp. 51-74.
• [7] Parekh, A.K. (1991). Analysis of Greedy Heuristic for Finding Small Dominating Sets in Graphs. Information Processing Letters Vol. 39, Issue 5, 237 – 240.
• [8] Ruan, L. & al., (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science Vol. 329, Issues 1– 3, 325–330.