ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Color-coding / 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: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / 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: A note on Hamiltonian split graphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / 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: Bandwidth of chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs with application to the minimum buffer size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time recognition algorithm for proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions for Hamiltonian split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for computing longest paths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Revision as of 14:25, 3 July 2024

scientific article
Language Label Description Also known as
English
ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
scientific article

    Statements

    ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (English)
    0 references
    0 references
    0 references
    6 January 2011
    0 references
    algorithmic graph theory
    0 references
    design and analysis of algorithms
    0 references
    graph classes
    0 references
    longest path problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers