An optimal parallel algorithm for computing cut vertices and blocks on interval graphs (Q4498117): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4893441 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770975 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding biconnected components in O(n) time for a class of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One-dimensional logic gate assignment and interval graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems / rank | |||
Normal rank |
Latest revision as of 12:17, 30 May 2024
scientific article; zbMATH DE number 1495726
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal parallel algorithm for computing cut vertices and blocks on interval graphs |
scientific article; zbMATH DE number 1495726 |
Statements
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs (English)
0 references
24 August 2000
0 references
interval graph
0 references
cut vertex
0 references
block
0 references
design of algorithms
0 references
analysis of algorithms
0 references