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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank

Latest revision as of 10:58, 27 May 2024

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