An efficient distributed algorithm for finding all hinge vertices in networks

References

• Ahuja , M. and Zhu , Y. An efficient distributed algorithm for finding articulation points, bridges and biconnected components in asynchronous networks . Proceedings of the 9th Conference on Foundations of Software Technology and Theoretical Computer Scienc , pp. 99 – 108 . Berlin : Springer-Verlag . LNCS 405
   Google Scholar
• Chaudhuri , P. 1994 . An efficient distributed bridge-finding algorithm . Information Sciences , 81 : 73 – 85 .
   Google Scholar
• Korach , E. , Rotem , D. and Santoro , N. 1984 . Distributed algorithms for finding centers and medians in networks . ACM Transactions on Programming Languages and Systems , 6 : 380 – 401 .
   Web of Science ®Google Scholar
• Chang , E. J.H. 1982 . Echo algorithms: depth parallel operations on general graphs . IEEE Transactions on Software Engineering , 8 : 391 – 401 .
   Google Scholar
• Hohberg , W. 1990 . How to find biconnected components in distributed networks . Journal of Parallel and Distributed Computing , 9 : 374 – 386 .
   Google Scholar
• Park , J. , Tokura , N. , Masuzawa , T. and Hagihara , K. 1991 . Efficient distributed algorithms solving problems about the connectivity of network . Systems and Computers in Japan , 22 : 1 – 16 .
   Google Scholar
• Awerbuch , B. and Gallager , R. G. 1987 . A new distributed algorithm to find breadth first search trees . IEEE Transactions on Information Theory , 33 : 315 – 322 .
   Google Scholar
• Bui , M. , Butelle , F. and Lavault , C. 2004 . A distributed algorithm for constructing a minimum diameter spanning tree . Journal of Parallel and Distributed Computing , 64 : 571 – 577 .
   Google Scholar
• Gallager , R. G. , Humblet , P. A. and Spira , P. M. 1983 . A distributed algorithm for minimum weight spanning trees . ACM Transactions in Programming Languages and Systems , 5 : 66 – 77 .
   Web of Science ®Google Scholar
• Lavallee , I. and Roucairol , G. 1986 . A fully distributed (minimal) spanning tree algorithm . Information Processing Letters , 23 : 55 – 62 .
   Google Scholar
• Farley , A. M. and Proskurowski , A. 1993 . Self-repairing networks . Parallel Processing Letters , 3 : 381 – 391 .
   Google Scholar
• Farley , A. M. and Proskurowski , A. 1997 . Minimum self-repairing graphs . Graphs and Combinatorics , 13 : 345 – 351 .
   Google Scholar
• Chang , J. M. and Ho , C. W. 2001 . Recognizing hinge-free line graphs and total graphs . Taiwanese Journal of Mathematics , 5 : 789 – 801 .
   Google Scholar
• Chang , J. M. , Ho , C. W. , Hsu , C. C. and Wang , Y. L. 1996 . The characterizations of hinge-free networks . Proceedings of the International Computer Symposium on Algorithms , : 105 – 112 .
   Google Scholar
• Chang , J. M. and Ho , C. W. 1998 . The recognition of geodetically connected graphs . Information Processing Letters , 65 : 81 – 88 .
   Google Scholar
• Entringer , R. C. , Jackson , D. E. and Slater , P. J. 1977 . Geodetic connectivity of graphs . IEEE Transactions on Circuits and Systems , 24 : 460 – 463 .
   Google Scholar
• Plesník , J. 2003 . Towards minimum k-geodetically connected graphs . Networks , 41 : 73 – 82 .
   Google Scholar
• Ho , T. Y. , Wang , Y. L. and Juan , M. T. 1996 . A linear time algorithm for finding all hinge vertices of a permutation graph . Information Processing Letters , 59 : 103 – 107 .
   Google Scholar
• Bera , D. , Pal , M. and Pal , T. K. 2003 . An efficient algorithm for finding all hinge vertices on trapezoid graphs . Theory of Computing Systems , 36 : 17 – 27 .
   Google Scholar
• Honma , H. and Masuyama , S. 2001 . A parallel algorithm for finding all hinge vertices of an interval graph . IEICE Transactions on Information and Systems , E84-D : 419 – 423 .
   Google Scholar
• Honma , H. and Masuyama , S. 2002 . A parallel algorithm for finding all hinge vertices of a trapezoid graph . IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , E85-A : 1031 – 1040 .
   Google Scholar
• Bera , D. , Pal , M. and Pal , T. K. 2001 . An optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs . Korean Journal of Computational and Applied Mathematics , 8 : 295 – 309 .
   Google Scholar
• Attiya , H. and Welch , J. 1998 . Distributed Computing: Fundamentals, Simulations and Advanced Topics , London : McGraw-Hill .
   Google Scholar
• Lynch , N. A. 1996 . Distributed Algorithms , San Francisco, CA : Morgan Kaufmann .
   Google Scholar
• Tell , G. 1994 . Distributed Algorithms Cambridge, , UK, Cambridge University Press
   Google Scholar
• Awerbuch , B. 1989 . “ Distributed shortest paths algorithms ” . In Proceedings of the 31st Annual ACM Symposium on Theory of Computing , 490 – 500 . New York : ACM .
   Google Scholar
• Awerbuch , B. and Gallager , R. G. Distributed BFS algorithms . Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Scienc , Washington, DC : IEEE .
   Google Scholar
• Misra , J. and Chandy , K. M. 1982 . A distributed graph algorithm: knot detection . ACM Transactions on Programming Languages and Systems , 4 : 678 – 686 .
   Google Scholar