✦ LIBER ✦

A note on two parallel algorithms to solve the stable marriage problem

✍ Scribed by Michael J. Quinn

Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 199 KB
Volume: 25
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01935367

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm to solve the stable

A parallel algorithm to solve the stable marriage problem

✍ S. S. Tseng; R. C. T. Lee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 477 KB

A sweepline algorithm to solve the two-c

A sweepline algorithm to solve the two-center problem

✍ Nen-Fu Huang; Ching-Ho Huang; Yue-Li Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB

A parallel algorithm for solving the col

A parallel algorithm for solving the coloring problem on trapezoid graphs

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 501 KB

An optimal algorithm for solving the sea

An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs

✍ William C.K. Yen; C.Y. Tang 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 264 KB

A Data Parallel Algorithm for Solving th

A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine

✍ N. Copty; S. Ranka; G. Fox; R.V. Shankar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 KB