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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6566281 / rank
 
Normal rank
Property / zbMATH Keywords
 
longest cycle
Property / zbMATH Keywords: longest cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian cycle
Property / zbMATH Keywords: Hamiltonian cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
solid grid graph
Property / zbMATH Keywords: solid grid graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962700727 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.07085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Q2921667 / 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: Finding Long Paths, Cycles and Circuits / 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: The Longest Path Problem Is Polynomial on Interval Graphs / 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: Algorithms and Computation / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:51, 11 July 2024

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

    Statements

    An approximation algorithm for the longest cycle problem in solid grid graphs (English)
    0 references
    7 April 2016
    0 references
    longest cycle
    0 references
    Hamiltonian cycle
    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
    0 references