Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1990: Foundations of Software Technology and Theoretical Computer Science pp 225–231Cite as

A fast parallel algorithm for finding a maximal bipartite set

  • Parallel Algorithms
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 472))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, L. Babai and A. Itai. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7 (1986), pp. 567–583.

    Google Scholar 

  2. S. A. Cook. Taxonomy of Problems with Fast Parallel Algorithms. Information and Control 64 (1985), pp. 2–22.

    Google Scholar 

  3. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979).

    Google Scholar 

  4. M. Goldberg and T. Spencer. A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Computing 18 (1989), pp. 419–427.

    Google Scholar 

  5. F. Harary, Graph Theory. Addison-Wesley, Reading, Mass. (1969).

    Google Scholar 

  6. R. M. Karp and A. Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. In Proc. 16th Annual ACM Symposium on Theory of Computing (1984), pp. 266–272.

    Google Scholar 

  7. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Computing 15 (1986), pp. 1036–1053.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, 14853, Ithaca, NY

    David Pearson & Vijay Vazirani

Authors
  1. David Pearson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pearson, D., Vazirani, V. (1990). A fast parallel algorithm for finding a maximal bipartite set. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-53487-3_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53487-7

  • Online ISBN: 978-3-540-46313-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation