An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (Q4285914): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:35, 6 February 2024
scientific article; zbMATH DE number 536850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs |
scientific article; zbMATH DE number 536850 |
Statements
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (English)
0 references
21 April 1994
0 references
modular decomposition of graphs
0 references
divide-and-conquer algorithm
0 references
prime tree decomposition
0 references
substitution decomposition
0 references
scheduling
0 references
