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

DOI10.1080/10637199508915506MaRDI QIDQ4820105zbMATHOpenAlexFDO

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

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

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)