• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS (1973)

Cached

  • Download as a PDF

Download Links

  • [www.cs.princeton.edu:80]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [cse.unl.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by John E. Hopcroft , Richard M. Karp
Citations:702 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Hopcroft73ann,
    author = {John E. Hopcroft and Richard M. Karp},
    title = {AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS},
    year = {1973}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.

Keyphrases

algorithm maximum matchings bipartite graph    bipartite graph    computational complexity    algorithmic analysis    key word    computation step    present paper    maximum matching   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University