A NOTE ON PARALLEL COMPLEXITY OF MAXIMUM F-MATCHING

Authors
DESSMARK A GARRIDO O LINGAS A
Citation
A. Dessmark et al., A NOTE ON PARALLEL COMPLEXITY OF MAXIMUM F-MATCHING, Information processing letters, 65(2), 1998, pp. 107-109
Citations number
14
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
65
Issue
2
Year of publication
1998
Pages
107 - 109
Database
ISI
SICI code
0020-0190(1998)65:2<107:ANOPCO>2.0.ZU;2-C
Abstract
We present a randomized NC solution to the problem of constructing a m aximum (cardinality) f-matching constraints. (C) 1998 Elsevier Science B.V.