The longest path problem is polynomial on cocomparability graphs (Q1939666): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56639277, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
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: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: The Hamiltonian circuit problem for circle graphs is NP-complete / 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: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large cycles in Hamiltonian graphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bump number is easy / 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: 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: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Hamiltonian circuit problem on directed path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Geometrical Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear structure of bipartite permutation graphs and the longest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for long paths in graphs / rank
 
Normal rank

Latest revision as of 06:31, 6 July 2024

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

    Statements

    The longest path problem is polynomial on cocomparability graphs (English)
    0 references
    0 references
    5 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    longest path problem
    0 references
    cocomparability graphs
    0 references
    permutation graphs
    0 references
    polynomial algorithm
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references