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.

Podrobná bibliografie
Vydáno v:Information processing letters. 59, 2 (1996).
Hlavní autor: Ho, Ting-Yem
Médium: Článek
Jazyk:English
Témata:
Algorithms.
Permutation graphs.
Hinge vertices.
Shortest paths.
Neighborhood.