Skip to main content
SpringerLink
Log in

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper, a sequential algorithm is presented to find all cut-vertices on trapezoid graphs. To every trapezoid graph G there is a corresponding trapezoid representation. If all the 4n corner points of n trapezoids, in a trapezoid representation of a trapezoid graph G with n vertices, are given, then the proposed sequential algorithm runs in O(n) time. Parallel implementation of this algorithm can be done in O(log n) time using O(n/ log n) processors on an EREW PRAM model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bera, M. Pal, and T.K. Pal, “An efficient algorithm to compute all cut vertices and blocks on permutation graphs,” Intern. J. Computer Maths., vol. 72, pp. 449–462, 1999.

    Google Scholar 

  2. D. Bera, M. Pal, and T.K. Pal, “An efficient algorithm for finding all hinge vertices on trapezoid graphs,” Theory of Computing Systems, vol. 36, no. 1, pp. 17–27, 2003.

    Google Scholar 

  3. F. Cheah and D.G. Corneil, “On the structure of trapezoid graphs,” Discrete Applied Mathematics, vol. 66, pp. 109–133, 1996.

    Google Scholar 

  4. H.C. Chen and Y.L. Wang, “A linear time algorithm for finding depth-first spanning trees on trapezoid graphs,” Information Processing Letters, vol. 63, pp. 13–18, 1997.

    Google Scholar 

  5. D.G. Corneil and P.A. Kamula, “Extensions of permutation and interval graphs,” in Proc. 18th Southeast Conf. on Combinatorics, Graph Theory and Computing, Congr. Numer., 1987, pp. 267–276.

  6. I. Dagan, M.C. Golumbic, and R.Y. Pinter, “Trapezoid graphs and their colouring,” Discrete Applied Mathematics, vol. 21, pp. 35–46, 1988.

    Google Scholar 

  7. S.K. Das and C.C.Y. Chen, “Efficient algorithms for computing articulation points and bridges of interval graphs,” in Proc. 1992 International Conf. on Parallel Processing, vol. 3, 1992, pp. III-164–III-167.

    Google Scholar 

  8. N. Deo, Graph theory with applications to engineering and computer science, Prentice Hall of India Pt. Ltd., New Delhi, 1990.

    Google Scholar 

  9. F. Harary, “Graph Theory,” Addison-Wesley: Reading, MA, 1969.

    Google Scholar 

  10. M. Hota, M. Pal, and T.K. Pal, “An efficient algorithm to generate all maximal independent sets on trapezoid graphs,” Intern. J. Computer Maths., vol. 70, pp. 587–599, 1999.

    Google Scholar 

  11. M. Hota, M. Pal, and T.K. Pal, “An efficient algorithm for finding a maximum weight k-independent set on trapezoid graphs,” Computational Optimization and Applications, vol. 18, pp. 49–62, 2001.

    Google Scholar 

  12. Y.D. Liang, “Domination in trapezoid graphs,” Information Processing Letters, vol. 52, pp. 309–315, 1994.

    Google Scholar 

  13. Y.D. Liang, “Steiner set and connected domination in trapezoid graphs,” Information Processing Letters, vol. 63, pp. 101–108, 1995.

    Google Scholar 

  14. T.H. Ma and J.P. Spinrad, “On the 2-chain subgraph cover and related problems,” J. Algorithms, vol. 17, pp. 251–268, 1994.

    Google Scholar 

  15. S. Mondal, M. Pal, and T.K. Pal, “An optimal algorithm for solving all-pairs shortest paths on trapezoid graphs,” Intern. J. of Computational Engineering Science, vol. 3, no. 2, pp. 103–116, 2002.

    Google Scholar 

  16. S. Nakayama and S. Masuyama, “A parallel algorithm for solving the colouring problem on trapezoid graphs,” Information Processing Letters, vol. 62, pp. 323–327, 1997.

    Google Scholar 

  17. M. Pal, “Efficient algorithms to compute all articulation points of a permutation graph,” The Korean J. of Computational and Applied Mathematics, vol. 5, pp. 141–152, 1998.

    Google Scholar 

  18. M. Pal, S. Mondal, D. Bera, and T.K. Pal, “An optimal parallel algorithm for computing cut vertices and blocks on interval graphs,” Intern. J. Computer Maths., vol. 75, pp. 59–70, 2000.

    Google Scholar 

  19. G.D.S. Ramkumar and C. Pandu Rangan, “Parallel algorithms on interval graphs,” in Proc. 1990 International Conf. on Parallel Processing, vol. 3, 1990, pp. 72–74.

    Google Scholar 

  20. R.E. Tarjan and U. Vishkin, “An efficient parallel biconnectivity algorithm,” SIAM J. Comput., vol. 14, pp. 862–874, 1985.

    Google Scholar 

  21. Y.H. Tsin and F.Y. Chain, “Efficient parallel algorithms for a class of graph theoretic problems,” SIAM J. Comput., vol. 13, pp. 580–599, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India

    Mrinmoy Hota, Madhumangal Pal & Tapan K. Pal

Authors
  1. Mrinmoy Hota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Madhumangal Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tapan K. Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hota, M., Pal, M. & Pal, T.K. Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. Computational Optimization and Applications 27, 95–113 (2004). https://doi.org/10.1023/B:COAP.0000004982.13444.bc

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:COAP.0000004982.13444.bc

Search

Navigation