The longest cycle problem is polynomial on interval graphs (Q2227488): 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.1016/j.tcs.2021.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3120803488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beautiful conjectures in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding longest cycles in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of longest cycles in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in interval graphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinants and Longest Cycles of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Length of Longest Paths and Cycles in 2-Connected Graphs / 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: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph / 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: The longest path problem has a polynomial solution on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path problem is polynomial on cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large degree vertices in longest cycles of graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2827796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and counting longest paths on circular-arc graphs in polynomial time / 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: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals of Longest Paths and Cycles / 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: The ratio of the longest cycle and longest path in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chords of longest cycles in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in \(k\)-connected graphs with given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges and chords of longest cycles in 3-connected graphs / rank
 
Normal rank

Latest revision as of 13:51, 24 July 2024

scientific article
Language Label Description Also known as
English
The longest cycle problem is polynomial on interval graphs
scientific article

    Statements

    The longest cycle problem is polynomial on interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2021
    0 references
    longest cycle problem
    0 references
    interval graphs
    0 references
    \(k\)-thick graphs
    0 references
    polynomial algorithm
    0 references
    dynamic programming
    0 references
    longest path problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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