Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A correct algorithm for hinge vertices problem of a permutation graph

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

zbMATH Open1278.68235MaRDI QIDQ2872779

Kodai Abe, Hirotoshi Honma, Yoko Nakajima

Publication date: 15 January 2014

Published in: Research Reports (Search for Journal in Brave)

Full work available at URL: http://ci.nii.ac.jp/naid/110009537112/en




Mathematics Subject Classification ID

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



Related Items (1)

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






This page was built for publication: A correct algorithm for hinge vertices problem of a permutation graph

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2872779&oldid=15816606"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki