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

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:2011-09 Issue:18 Volume:111 Page:891-894
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Honma Hirotoshi,Abe Kodai,Masuyama Shigeru

Funder

Grant-in-Aid for Scientific Research (C), Japan Society for the Promotion of Science

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference7 articles.

1. An efficient algorithm for finding all hinge vertices on trapezoid graphs;Bera;Theory Comput. Syst.,2003

2. The recognition of geodetically connected graphs;Chang;Inform. Process. Lett.,1998

3. Finding the set of all hinge vertices for strongly chordal graphs in linear time;Chang;Inform. Sci.,1997

4. Self-repairing networks;Farley;Parallel Process. Lett.,1993

5. A linear time algorithm for finding all hinge vertices of a permutation graph;Ho;Inform. Process. Lett.,1996

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2015

2. Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2014

3. Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs;IEICE Transactions on Information and Systems;2013