PARALLEL APPROXIMATE MATCHING (Q4819985)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 2106602

Language	Label	Description	Also known as
English	PARALLEL APPROXIMATE MATCHING	scientific article; zbMATH DE number 2106602

Statements

scholarly article

0 references

PARALLEL APPROXIMATE MATCHING (English)

0 references

Thomas H. Spencer

0 references

Parallel Algorithms and Applications

0 references

publication date

6 October 2004

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10637199408915410

0 references

TWO THEOREMS IN GRAPH THEORY

0 references

Matrix multiplication via arithmetic progressions

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

An improved parallel algorithm for maximal matching

0 references

Constructing a perfect matching is in random NC

0 references

Matching is as easy as matrix inversion

0 references

Identifiers

zbMATH Open document ID

0 references

10.1080/10637199408915410

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4819985

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4819985&oldid=34371776"