𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constant-time parallel recognition of split graphs

✍ Scribed by Stavros D. Nikolopoulos

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
738 KB
Volume
54
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Linear recognition of pseudo-split graph
Linear recognition of pseudo-split graphs
✍ FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 370 KB
Parallel Algorithms for Hierarchical Clu
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
✍ Elias Dahlhaus πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 306 KB

We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel

Almost optimal sublinear time parallel r
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
✍ Lawrence L. Larmore; Wojciech Rytter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 803 KB

Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages (unambiguous, deterministic and linear) are presented. Optimality is measured with respect to the work of the best-known sequential algorithm for a given problem.