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]

• 資料種別: 記事
• タイトル: 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]
• 著者標目: Hirotoshi Honma; Kodai Abe; Shigeru Masuyama
• 出版年月日等: 2011-09
• 出版年（W3CDTF）: 2011-09
• タイトル（掲載誌）: Information Processing Letters
• 巻号年月日等（掲載誌）: 111 18
• 掲載巻: 111
• 掲載号: 18
• 掲載ページ: 891-894
• 掲載年月日（W3CDTF）: 2011-09
• ISSN（掲載誌）: 00200190
• 出版事項（掲載誌）: Elsevier BV
• 件名標目: Computer Science Applications; Information Systems; Signal Processing; Theoretical Computer Science
• 対象利用者: 一般
• DOI: 10.1016/j.ipl.2011.01.014
• 作成日（W3CDTF）: 2011-07-05
• 著作権情報: https://www.elsevier.com/tdm/userlicense/1.0/
• 関連情報（URI）: https://api.elsevier.com/content/article/PII:S0020019011000238?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0020019011000238?httpAccept=text/plain
• 参照: Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs; https://cir.nii.ac.jp/crid/1390001204379678848; Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs; https://cir.nii.ac.jp/crid/1390001206310277760; Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph; https://cir.nii.ac.jp/crid/1390001206310824576
• 参照: An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs; https://cir.nii.ac.jp/crid/1360574094529109888; Finding the set of all hinge vertices for strongly chordal graphs in linear time; https://cir.nii.ac.jp/crid/1360855570656334464; The recognition of geodetically connected graphs; https://cir.nii.ac.jp/crid/1361137045302286592; Transitive Orientation of Graphs and Identification of Permutation Graphs; https://cir.nii.ac.jp/crid/1362544419500493824; A linear time algorithm for finding all hinge vertices of a permutation graph; https://cir.nii.ac.jp/crid/1362544420125559936; SELF-REPAIRING NETWORKS; https://cir.nii.ac.jp/crid/1362825894592374400; Some optimal parallel algorithms on interval and circular-arc graphs; https://cir.nii.ac.jp/crid/1371977244006306948
• 連携機関・データベース: 国立情報学研究所 : CiNii Research
• 提供元機関・データベース: Crossref; https://www.crossref.org; 科学研究費助成事業データベース; https://kaken.nii.ac.jp/ja