✦ LIBER ✦

A note on parallel complexity of maximum f-matching

✍ Scribed by Anders Dessmark; Oscar Garrido; Andrzej Lingas

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 306 KB
Volume: 65
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00196-8

No coin nor oath required. For personal study only.

✦ Synopsis

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

📜 SIMILAR VOLUMES

A note on the parallel complexity of ant

A note on the parallel complexity of anti-unification

✍ G. M. Kuper; K. W. McAloon; K. V. Palem; K. J. Perry 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 461 KB

A note on the number of N-bit strings wi

A note on the number of N-bit strings with maximum complexity

✍ G.J. Chaitin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 187 KB

On the Parallel Complexity of Hamiltonia

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs

✍ E. Dahlhaus; P. Hajnal; M. Karpinski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 729 KB

A remark on maximum matching of line gra

A remark on maximum matching of line graphs

✍ Shuji Shiraishi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Note on reliability of a system complexi

Note on reliability of a system complexity

✍ T. Nakagawa; K. Yasui 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Most systems have been recently complicated with remarkable development of their high performances. Both hardware and softavare become redundant, and sometimes, serious problems of interference between them might be newly generated. It would be inappropriate to calculate the reliabilities of such co

On the complexity of a family of general

On the complexity of a family of generalized matching problems

✍ Ten-Hwang Lai; Alan Sprague 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 787 KB