Simple linear time recognition of unit interval graphs (Q672408): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval 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: 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: The Scott-Suppes theorem on semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurement Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundational aspects of theories of measurement / rank
 
Normal rank

Latest revision as of 11:17, 27 May 2024

scientific article
Language Label Description Also known as
English
Simple linear time recognition of unit interval graphs
scientific article

    Statements

    Simple linear time recognition of unit interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    Graph algorithms
    0 references
    Interval graphs
    0 references
    Breadth-first search
    0 references
    Unit interval graphs
    0 references
    Proper interval graphs
    0 references
    Design of algorithms
    0 references