SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 15 / Issue 1

SIAM J. Comput. 15, pp. 120-130 (11 pages)

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Zvi Galil, Silvio Micali, and Harold Gabow

Full Text: Download PDF | Buy PDF (US$25) | View Cart
We define two generalized types of a priority queue by allowing some forms of changing the priorities of the elements in the queue. We show that they can be implemented efficiently. Consequently, each operation takes $O(\log n)$ time. We use these generalized priority queues to construct an $O(EV\log V)$ algorithm for finding a maximal weighted matching in general graphs.

© 1986 © Society for Industrial and Applied Mathematics

KEYWORDS

PUBLICATION DATA

ISSN

0097-5397 (print)  
1095-7111 (online)

Publisher

$abstract.society.value is a Member of CrossRef © Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received June 16, 1983
Digital Object Identifier
http://dx.doi.org/10.1137/0215009

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
  2. The Generalized Graetz Problem in Finite Domains
  3. Self-Similar Voiding Solutions of a Single Layered Model of Folding Rocks
  4. Geometry-Driven Charge Accumulation in Electrokinetic Flows between Thin, Closely Spaced Laminates
  5. A Generalized Birkhoff–Rott Equation for Two-dimensional Active Scalar Problems
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close