Matches in SemOpenAlex for { <https://semopenalex.org/work/W2119340899> ?p ?o ?g. }
Showing items 1 to 56 of
56
with 100 items per page.
- W2119340899 endingPage "121" @default.
- W2119340899 startingPage "115" @default.
- W2119340899 abstract "Determining the parallel complexity of maximum cardinality matching in bipartite graphs is one of the most famous open problems in parallel algorithm design. The problem is known to be in RNC, but all known fast (polylogarithmic running time) parallel algorithms that find maximum cardinality matchings require the use of random numbers. Moreover, they are based on matrix algebra, so they are inherently inefficient for sparse graphs. Therefore, we are interested in the problem of finding an approximate maximum cardinality matching. The parallel matching algorithm of Goldberg, Plotkin and Vaidya (FOCS 1988) can be modified so that it runs in O(a2log3n) time on an EREW PRAM with n + m processors and finds a matching of size (1 - 1/a)p when given a graph with n vertices, m edges, and a maximum cardinality matching of size p. The resulting algorithm is deterministic." @default.
- W2119340899 created "2016-06-24" @default.
- W2119340899 creator A5029058636 @default.
- W2119340899 date "1994-01-01" @default.
- W2119340899 modified "2023-09-23" @default.
- W2119340899 title "PARALLEL APPROXIMATE MATCHING" @default.
- W2119340899 cites W1579753833 @default.
- W2119340899 cites W1981234161 @default.
- W2119340899 cites W1992060486 @default.
- W2119340899 cites W2029131980 @default.
- W2119340899 cites W2037752639 @default.
- W2119340899 cites W2048652909 @default.
- W2119340899 cites W2073975876 @default.
- W2119340899 cites W2080063509 @default.
- W2119340899 cites W2089828587 @default.
- W2119340899 cites W2123806189 @default.
- W2119340899 cites W2157529519 @default.
- W2119340899 cites W2610729871 @default.
- W2119340899 doi "https://doi.org/10.1080/10637199408915410" @default.
- W2119340899 hasPublicationYear "1994" @default.
- W2119340899 type Work @default.
- W2119340899 sameAs 2119340899 @default.
- W2119340899 citedByCount "3" @default.
- W2119340899 countsByYear W21193408992012 @default.
- W2119340899 countsByYear W21193408992014 @default.
- W2119340899 crossrefType "journal-article" @default.
- W2119340899 hasAuthorship W2119340899A5029058636 @default.
- W2119340899 hasConcept C105795698 @default.
- W2119340899 hasConcept C165064840 @default.
- W2119340899 hasConcept C33923547 @default.
- W2119340899 hasConcept C41008148 @default.
- W2119340899 hasConceptScore W2119340899C105795698 @default.
- W2119340899 hasConceptScore W2119340899C165064840 @default.
- W2119340899 hasConceptScore W2119340899C33923547 @default.
- W2119340899 hasConceptScore W2119340899C41008148 @default.
- W2119340899 hasIssue "1-2" @default.
- W2119340899 hasLocation W21193408991 @default.
- W2119340899 hasOpenAccess W2119340899 @default.
- W2119340899 hasPrimaryLocation W21193408991 @default.
- W2119340899 hasRelatedWork W1974891317 @default.
- W2119340899 hasRelatedWork W2044189972 @default.
- W2119340899 hasRelatedWork W2313400459 @default.
- W2119340899 hasRelatedWork W2361944761 @default.
- W2119340899 hasRelatedWork W2363160663 @default.
- W2119340899 hasRelatedWork W2368676408 @default.
- W2119340899 hasRelatedWork W2380389143 @default.
- W2119340899 hasRelatedWork W2391408860 @default.
- W2119340899 hasRelatedWork W2748952813 @default.
- W2119340899 hasRelatedWork W2899084033 @default.
- W2119340899 hasVolume "2" @default.
- W2119340899 isParatext "false" @default.
- W2119340899 isRetracted "false" @default.
- W2119340899 magId "2119340899" @default.
- W2119340899 workType "article" @default.