A simple nc algorithm to recognize weakly triangulated graphs (Q4729374): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weakly triangulated graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3732972 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(logn) parallel connectivity algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implementation of simultaneous memory address access in models that forbid it / rank | |||
Normal rank |
Latest revision as of 09:33, 20 June 2024
scientific article; zbMATH DE number 4114053
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple nc algorithm to recognize weakly triangulated graphs |
scientific article; zbMATH DE number 4114053 |
Statements
A simple nc algorithm to recognize weakly triangulated graphs (English)
0 references
1989
0 references
parallel algorithms
0 references
perfect graphs
0 references
NC algorithm
0 references