𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong Connectivity in Directional Nearest-Neighbor Graphs

✍ Scribed by Flinchbaugh, B. E.; Jones, L. K.

Book ID
118212401
Publisher
Society for Industrial and Applied Mathematics
Year
1981
Weight
249 KB
Volume
2
Category
Article
ISSN
0196-5212

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connectivity of the mutual k-nearest-nei
Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
✍ M.R. Brito; E.L. ChΓ‘vez; A.J. Quiroz; J.E. Yukich πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 610 KB

For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is proposed and its performance is evaluated in simulated

Covers and strong covers in directed bip
Covers and strong covers in directed bipartite graphs
✍ K. Vidyasankar πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

## Abstract Let __G__ be a finite graph with directed bipartition (__V__^+^, __V__^βˆ’^). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to __V__^+^, and (ii) include a given set of edges that satisfies matching with