A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990242495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / 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: A Fully Dynamic Algorithm for Recognizing and Representing Proper 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: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / 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: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035766 / rank
 
Normal rank

Latest revision as of 18:27, 6 June 2024

scientific article
Language Label Description Also known as
English
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
scientific article

    Statements

    A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (English)
    0 references
    6 August 2004
    0 references
    Unit interval graphs
    0 references
    Proper interval graphs
    0 references
    Graph recognition algorithm
    0 references
    Lexicographic breadth first search
    0 references

    Identifiers