Skip to main content
SpringerLink
Log in

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

The distance between at least two vertices becomes longer after the removal of a hinge vertex. Thus a faulty hinge vertex will increase the overall communication cost in a network. Therefore, finding the set of all hinge vertices in a graph can be used to identify critical nodes in a real network. An O(n log n) time algorithm has been proposed here to find all hinge vertices of a trapezoid graph with n vertices.

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

Author information

Authors and Affiliations

  1. Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, madhumangal@lycos.com, Midnapore-721 102, India, IN

    Debashis Bera, Madhumangal Pal & Tapan K. Pal

Authors
  1. Debashis Bera
    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

Bera, D., Pal, M. & Pal, T.K. An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. Theory Comput. Systems 36, 17–27 (2003). https://doi.org/10.1007/s00224-002-1004-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-002-1004-3

Keywords

Search

Navigation