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

A fast and efficient NC algorithm for maximal matching

โœ Scribed by Zhi-Zhong Chen

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast and Robust Stereo Matching Algorith
Fast and Robust Stereo Matching Algorithms for Mining Automation
โœ Jasmine Banks; Mohammed Bennamoun; Peter Corke ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 184 KB

The mining environment, being complex, irregular, and time-varying, presents a challenging prospect for stereo vision. For this application, speed, reliability, and the ability to produce a dense depth map are of foremost importance. This paper evaluates a number of matching techniques for possible

Efficient Sequential and Parallel Algori
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
โœ D. Pearson; V.V. Vazirani ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

A maximal bipartite set (MBS) in an undirected graph \(G=(V, E)\) is a maximal collection of vertices \(B \subseteq V\) whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 1.1993 Acatemic Press, Inc