Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph

DOI10.1016/J.IPL.2011.01.014MaRDI QIDQ1944158zbMATH OpenOpenAlexFDO

Authors Hirotoshi Honma, Kodai Abe, Shigeru Masuyama

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.01.014

zbMATH Keywords

analysis of algorithmsdesign of algorithmshinge verticespermutation graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cites work

• A linear time algorithm for finding all hinge vertices of a permutation graph
• An efficient algorithm for finding all hinge vertices on trapezoid graphs
• The recognition of geodetically connected graphs
• Transitive Orientation of Graphs and Identification of Permutation Graphs

Cited in

(1)

• A linear time algorithm for finding all hinge vertices of a permutation graph

This page was built for publication: Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944158)