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 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ross M. McConnell / rank | |||
| Property / author | |||
| Property / author: Ross M. McConnell / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:54, 20 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
