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

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

Bibliografiset tiedot
Julkaisussa:Information processing letters. 59, 2 (1996).
Päätekijä: Ho, Ting-Yem
Aineistotyyppi: Artikkeli
Kieli:English
Aiheet:
Algorithms.
Permutation graphs.
Hinge vertices.
Shortest paths.
Neighborhood.