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

From MaRDI portal
Revision as of 20:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A linear time algorithm for finding all hinge vertices of a permutation graph
scientific article

    Statements

    A linear time algorithm for finding all hinge vertices of a permutation graph (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms
    0 references
    Permutation graphs
    0 references
    Hinge vertices
    0 references
    Shortest paths
    0 references
    Neighborhood
    0 references
    0 references