Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1944158
Jump to:navigation, search

DOI10.1016/j.ipl.2011.01.014zbMath1260.68296OpenAlexW2036503007MaRDI QIDQ1944158

Hirotoshi Honma, Shigeru Masuyama, Kodai Abe

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 algorithmspermutation graphshinge vertices


Mathematics Subject Classification ID

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




Cites Work

  • The recognition of geodetically connected graphs
  • A linear time algorithm for finding all hinge vertices of a permutation graph
  • An efficient algorithm for finding all hinge vertices on trapezoid graphs
  • Transitive Orientation of Graphs and Identification of Permutation Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1944158&oldid=14380939"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki