๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

N-graphs: Scalable topology and design of balanced divide-and-conquer algorithms

โœ Scribed by Sergei Gorlatch

Book ID
104304535
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
831 KB
Volume
23
Category
Article
ISSN
0167-8191

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