Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561)

From MaRDI portal
Revision as of 06:00, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
scientific article

    Statements

    Solving the path cover problem on circular-arc graphs by using an approximation algorithm (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    Graph algorithms
    0 references
    Path cover
    0 references
    Hamiltonian cycle
    0 references
    Hamiltonian path
    0 references
    Interval graphs
    0 references
    Circular-arc graphs
    0 references

    Identifiers