Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
type: Item
instance of: scholarly article
title: Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
zbMATH Open document ID: 0827.68052
DOI: 10.1007/BF01293484
author: Danilo Bruschi
author: F. Ravasio
published in: Algorithmica
publication date: 1995-05-30T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 759299
zbMATH Keywords: exact problems
zbMATH Keywords: disjoint cycles
zbMATH Keywords: perfect matchings
zbMATH Keywords: randomized parallel algorithms
MaRDI profile type: Publication
cites work: Exact arborescences, matchings and cycles
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: Random pseudo-polynomial algorithms for exact matroid problems
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Optimum branchings
cites work: Q5653524
cites work: On Computing the Exact Determinant of Matrices with Polynomial Entries
cites work: Q4385522
cites work: The complexity of parallel search
cites work: Matching is as easy as matrix inversion
cites work: The complexity of restricted spanning tree problems
cites work: The complexity of facets (and some facets of complexity)
cites work: The Factorization of Linear Graphs
cites work: Relative complexity of checking and evaluating
cites work: NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
cites work: More complicated questions about maxima and minima, and some closures of NP
full work available at URL: https://doi.org/10.1007/bf01293484
OpenAlex ID: W2094182335
description: scientific article; zbMATH DE number 759299