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.

Bibliografske podrobnosti
izdano v:Information processing letters. 59, 2 (1996).
Glavni avtor: Ho, Ting-Yem
Format: Article
Jezik:English
Teme:
Algorithms.
Permutation graphs.
Hinge vertices.
Shortest paths.
Neighborhood.