An approximation algorithm for the longest path problem in solid grid graphs (Q2815541): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2015.1130130 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2570242489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the longest cycle problem in solid grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a longest path in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Longest Cycles in Graphs with Bounded Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming approaches to solve the shortest path problem with forbidden paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Paths and Cycles of Superpolylogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Longest Path in a Complete Multipartite Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the longest path problem in rectangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the longest paths in grid graphs / rank
 
Normal rank

Latest revision as of 06:45, 12 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the longest path problem in solid grid graphs
scientific article

    Statements

    An approximation algorithm for the longest path problem in solid grid graphs (English)
    0 references
    29 June 2016
    0 references
    longest path
    0 references
    Hamiltonian path
    0 references
    approximation algorithm
    0 references
    solid grid graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references