Erratum and addendum to “A linear time algorithm for finding all hinge vertices of a permutation graph” [Information Processing Letters 59 (2) (1996) 103–107]

This note points out and corrects an error in the algorithm proposed in [Ting-Yem Ho, Yue-Li Wang and Ming-Tsan Juan, A linear time algorithm for finding all hinge vertices of a permutation graph, Information Processing Letters 59 (2) (1996) 103–107].

► Ho et al. presented an algorithm for hinge vertices problem of permutation graphs.
► We pointed out and corrected an error in their algorithm.
► Our algorithm can run without increasing time complexity.
► Finding all hinge vertices is useful for identifying critical nodes in a network.