Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55952669, #quickstatements; #temporary_batch_1707252663060
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / 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: Classes of bipartite graphs related to chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge inducibility of 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: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(97)00241-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161426837 / rank
 
Normal rank

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
scientific article

    Statements

    Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (English)
    0 references
    0 references
    21 August 2000
    0 references
    algorithm
    0 references
    data-structure
    0 references
    partition refinement
    0 references
    graph
    0 references
    Boolean matrix
    0 references

    Identifiers