External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An O(n^2.5) Algorithm for Maximum Matching in General Graphs

Shimon Even, Oded Kariv. An O(n^2.5) Algorithm for Maximum Matching in General Graphs. In 16th Annual Symposium on Foundations of Computer Science, 13-15 October, 1975, The University of California, Berkeley, CA, USA. pages 100-112, IEEE, 1975.

Abstract

Abstract is missing.

runs on