ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Processing Letters
Volume 65, Issue 2, 29 January 1998, Pages 107-109
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (305 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0020-0190(97)00196-8    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1998 Published by Elsevier Science B.V.

A note on parallel complexity of maximum f-matching

Anders Dessmark, Oscar Garrido and Andrzej LingasCorresponding Author Contact Information

Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

Received 18 July 1995; 
revised 16 June 1997. 
Communicated by F. Dehne 
Available online 20 June 1998.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints.

Author Keywords: Theory of computation; Parallel algorithms; Maximum matching

Article Outline

• References

Information Processing Letters
Volume 65, Issue 2, 29 January 1998, Pages 107-109
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.