𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms to compute all articulation points of a permutation graph

✍ Scribed by Pal, Madhumangal

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
135 KB
Volume
5
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for computing th
A linear-time algorithm for computing the intersection of all odd cycles in a graph
✍ Leizhen Cai; Baruch Schieber πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.