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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.06.010 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.010 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047690551 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047690551 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.06.010 / rank
 
Normal rank

Latest revision as of 01:53, 10 December 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