Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259): 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.aml.2010.11.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968832374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deferred-query: An efficient approach for some problems on interval 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: 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: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian problem on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mapping processes to processors in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and maps of DNA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank

Latest revision as of 21:19, 3 July 2024

scientific article
Language Label Description Also known as
English
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
scientific article

    Statements

    Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (English)
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    certifying algorithms
    0 references
    path cover
    0 references
    Hamiltonian cycle
    0 references
    interval graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references