Some Efficient Algorithms for Permutation Graphs (Q4290917)

From MaRDI portal
Revision as of 23:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 563097
Language Label Description Also known as
English
Some Efficient Algorithms for Permutation Graphs
scientific article; zbMATH DE number 563097

    Statements

    Some Efficient Algorithms for Permutation Graphs (English)
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    0 references
    connected dominating set
    0 references
    permutation graphs
    0 references
    minimum Steiner set
    0 references
    single-source shortest path
    0 references
    0 references