Approximating the longest paths in grid graphs (Q719276): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Longest Cycle Problem in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumference of Graphs with Bounded Degree / 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: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263715 / rank
 
Normal rank

Revision as of 11:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximating the longest paths in grid graphs
scientific article

    Statements

    Approximating the longest paths in grid graphs (English)
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    long paths
    0 references
    square-free 2-factor
    0 references
    grid graphs
    0 references
    approximation algorithm
    0 references

    Identifiers