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

Bibliografiska uppgifter
I publikationen:	Information processing letters. 59, 2 (1996).
Huvudupphovsman:	Ho, Ting-Yem
Materialtyp:	Artikel
Språk:	English
Ämnen:	Algorithms. Permutation graphs. Hinge vertices. Shortest paths. Neighborhood.