Abstract
The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a distributed environment based on a constructive approach. The contribution of this paper is threefold. First, using a pre-constructed spanning tree of the considered graph, we present a protocol to test whether a given graph is 2-connected using only local knowledge. Second, we present an encoding of this protocol using graph relabeling systems. The last contribution is the implementation of this protocol in the message passing model. For a given graph \(\: G ,\:\) where \(\: M \:\) is the number of its edges, \(\: N \:\) the number of its nodes and \(\: \Delta \:\) is its degree, our algorithms need the following requirements: The first one uses \(\:O(\Delta \times N^2 )\:\) steps and \(\:O(\Delta \times \log \Delta)\:\) bits per node. The second one uses \(\: O(\Delta \times N^2 )\:\) messages and \(\:O(N^2)\:\) time and \(\:O(\Delta \times \log \Delta)\:\) bits per node. Furthermore, the studied network is semi-anonymous: Only the root of the pre-constructed spanning tree needs to be identified. Moreover, we investigate some applications that can use our protocol as a pre-processing task for initial configurations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Attiya, H., Welch, J.: Distributed computing, fundamentals, simulations and advanced topics. McGraw-hill international (UK) limited, New York (1998)
Bahramgiri, M., Hajiaghayi, M.T., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In: ICCCN 2002. IEEE Int. Conf. on Computer Communications and Networks, pp. 392–397. IEEE Computer Society Press, Los Alamitos (2002)
Chen, W., Wada, K.: Optimal fault-tolerant routings with small routing tables for k-connected graphs. J. Discrete Algorithms 2(4), 517–530 (2004)
Esfahanian, A.H., Hakimi, S.L.: On computing the connectivities of graphs and digraphs. Networks, 355–366 (1984)
Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM Journal on Computing 4(4), 507–518 (1975)
Gabow, H.N.: Using expander graphs to find vertex connectivity. In: 41st Annual Symposium on Foundations of Computer Science, pp. 410–420 (2000)
Henzinger, M.R., Rao, S., Gabow, H.N.: Computing vertex connectivity: new bounds from old techniques. J. Algorithms 34(2), 222–250 (2000)
Litovsky, I., Métivier, Y., Sopena, E.: Graph relabeling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1–56. World Scientific Publishing, Singapore (1999)
Métivier, Y., Mosbah, M., Sellami, A.: Proving distributed algorithms by graph relabeling systems: Example of tree in networks with processor identities. In: Applied Graph Transformations (AGT 2002), Grenoble (2002)
De Prisco, R., Lampson, B., Lynch, N.: Revisiting the paxos algorithm. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol. 1320, pp. 111–125. Springer, Heidelberg (1997)
Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Tel, G.: Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)
West, D.: Introduction to graph theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamid, B., Le Saëc, B., Mosbah, M. (2007). Distributed Local 2-Connectivity Test of Graphs and Applications. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)