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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1994.1013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027604814 / rank | |||
Normal rank | |||
Revision as of 23:54, 19 March 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
