𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(n2) Algorithm for Undirected Split Decomposition

✍ Scribed by T.H. Ma; J. Spinrad

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
654 KB
Volume
16
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An O(n2) Divide-and-Conquer Algorithm fo
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
✍ A. Ehrenfeucht; H.N. Gabow; R.M. Mcconnell; S.J. Sullivan πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 526 KB

This paper presents a simple divide-and-conquer algorithm for computing the prime tree decomposition of a two-structure. The algorithm runs in \(O\left(n^{2}\right)\) time, when \(n\) is the number of nodes of the two-structure. A directed or undirected graph is a special case of a two-structure, an