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

Implementation of some image thresholding algorithms on a connection machine-200

โœ Scribed by N.B. Venkateswarlu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
735 KB
Volume
16
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A characterisation of some 2-connected g
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
โœ Victor Bryant ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem. usually dealt with in two cases. is in fact covered by one of the cases. ## 1. Some 2-connected graphs Throughout this paper G = (V, E)