A fast parallel algorithm to recognize partitionable graphs (Q917295): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for recognizing chordal graphs and k trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bipolarizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on superbrittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361906 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90085-c / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980804329 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
A fast parallel algorithm to recognize partitionable graphs
scientific article

    Statements

    A fast parallel algorithm to recognize partitionable graphs (English)
    0 references
    1990
    0 references
    NC algorithms
    0 references
    brittle graphs
    0 references
    EREW parallel random access machine
    0 references

    Identifiers