Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Finding Hamiltonian circuits in proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / 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: 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: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the path cover problem on circular-arc graphs by using an approximation algorithm / 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: Random generation of combinatorial structures from a uniform distribution / 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: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341806 / 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: Self-testing algorithms for self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc 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

Latest revision as of 11:19, 8 July 2024

scientific article
Language Label Description Also known as
English
Computing and counting longest paths on circular-arc graphs in polynomial time
scientific article

    Statements

    Computing and counting longest paths on circular-arc graphs in polynomial time (English)
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    circular-arc graphs
    0 references
    interval graphs
    0 references
    longest path problem
    0 references
    counting
    0 references
    approximation algorithm
    0 references
    dynamic programming
    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