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]

• Published in: Information processing letters Vol. 111; no. 18; pp. 891 - 894
• Main Authors: Honma, Hirotoshi, Abe, Kodai, Masuyama, Shigeru
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01-09-2011
• Subjects: Analysis of algorithms; Design of algorithms; Hinge vertices; Permutation graphs; Permutation graphs; Design of algorithms; Analysis of algorithms; Hinge vertices
• ISSN: 0020-0190; 1872-6119
• DOI: 10.1016/j.ipl.2011.01.014

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.