THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†

DOI10.1080/10637199508915506zbMATH Open1049.68608OpenAlexW2026317193MaRDI QIDQ4820105FDOQ4820105

Authors: Constantine N. K. Osiakwan, Selim G. Akl 

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199508915506

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Matching, Euler tours and the Chinese postman
• Parallel computation of matchings in trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
• Alternation
• Constructing a perfect matching is in random NC
• Improved processor bounds for combinatorial problems in RNC
• On Relating Time and Space to Size and Depth
• The Parallel Evaluation of General Arithmetic Expressions
• Linear programming is log-space hard for P
• Title not available (Why is that?)
• A complexity theory of efficient parallel algorithms
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• A universal interconnection pattern for parallel computers
• Efficient parallel algorithms for graph problems
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Finding Euler tours in parallel

This page was built for publication: THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820105)