An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262)

From MaRDI portal
Revision as of 22:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An improved exact algorithm for TSP in graphs of maximum degree 4
scientific article

    Statements

    An improved exact algorithm for TSP in graphs of maximum degree 4 (English)
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    exact exponential algorithm
    0 references
    graph algorithm
    0 references
    measure-and-conquer
    0 references
    0 references