A note on parallel complexity of maximum f-matching

DOI10.1016/S0020-0190(97)00196-8zbMATH Open1338.68100MaRDI QIDQ293199FDOQ293199

Authors: Anders Dessmark, Oscar Garrido, Andrzej Lingas 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001968?np=y

zbMATH Keywords

parallel algorithmsmaximum matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Constructing a perfect matching is in random NC
• Title not available (Why is that?)
• Matching is as easy as matrix inversion
• A Las Vegas RNC algorithm for maximum matching
• Improved processor bounds for combinatorial problems in RNC
• Parallel Merge Sort
• Title not available (Why is that?)
• PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS
• Title not available (Why is that?)
• On parallel complexity of maximum f-matching and the degree sequence problem
• A Short Proof of the Factor Theorem for Finite Graphs

Cited In (2)

• Distributed backup placement in networks
• Title not available (Why is that?)

This page was built for publication: A note on parallel complexity of maximum \(f\)-matching

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