Matches in SemOpenAlex for { <https://semopenalex.org/work/W2103283457> ?p ?o ?g. }
Showing items 1 to 54 of
54
with 100 items per page.
- W2103283457 endingPage "224" @default.
- W2103283457 startingPage "197" @default.
- W2103283457 abstract "Graph algorithms use various techniques to achieve higher efficiency. In this review we exemplify the design and analysis of efficient graph algorithms by surveying algorithms for the four closely related problems of finding a maximum cardinality or weighted matching in general or bipartite graphs. Mathematicall y, these are all special cases of the problem of weighted matching in general graphs. However, we consider them in increasing order of difficulty because the easier the problem , the faster or simpler its solution. First we discuss sequential algorithms, and then we describe parallel algo rithms. Surprisingl y, at the moment, entirely different techniques are used for sequential and parallel algorithms. For sequential algorithms our computational model is the uniform cost random access machine or RAM (Aho et al 1974). Given a problem , we first try to solve it in polynomial time . Once a polynomial-time solution is found, we try to improve the solution by speeding it up. Our parallel computational model is the PRAM (Fortune & Wyllie 1978). It is a parallel computer with p processors (RAMs) that share a common memory. We allow only simultaneous reads from , but not simultaneous writes to, the same memory location. Given a problem, we first try to show that it is in the class NC (Cook 1983) by designing an algorithm that uses a polynomial number of processors and poly-logarithmic time. We call such an algorithm an NC algorithm. Alternative ly, if we use randomizat ion, we design an RNC algorithm. Once we establish that the problem is in NC or" @default.
- W2103283457 created "2016-06-24" @default.
- W2103283457 creator A5048955152 @default.
- W2103283457 date "1986-06-01" @default.
- W2103283457 modified "2023-10-18" @default.
- W2103283457 title "Sequential and Parallel Algorithms for Finding Maximum Matchings in Graphs" @default.
- W2103283457 cites W1975146994 @default.
- W2103283457 cites W1981234161 @default.
- W2103283457 cites W1985061810 @default.
- W2103283457 cites W2002531683 @default.
- W2103283457 cites W2004618348 @default.
- W2103283457 cites W2040326319 @default.
- W2103283457 cites W2041786457 @default.
- W2103283457 cites W2048652909 @default.
- W2103283457 cites W2053913299 @default.
- W2103283457 cites W2056352038 @default.
- W2103283457 cites W2059608229 @default.
- W2103283457 cites W2084224084 @default.
- W2103283457 cites W2085750496 @default.
- W2103283457 cites W2124852572 @default.
- W2103283457 cites W2169528473 @default.
- W2103283457 cites W2222512263 @default.
- W2103283457 doi "https://doi.org/10.1146/annurev.cs.01.060186.001213" @default.
- W2103283457 hasPublicationYear "1986" @default.
- W2103283457 type Work @default.
- W2103283457 sameAs 2103283457 @default.
- W2103283457 citedByCount "10" @default.
- W2103283457 crossrefType "journal-article" @default.
- W2103283457 hasAuthorship W2103283457A5048955152 @default.
- W2103283457 hasConcept C11413529 @default.
- W2103283457 hasConcept C41008148 @default.
- W2103283457 hasConceptScore W2103283457C11413529 @default.
- W2103283457 hasConceptScore W2103283457C41008148 @default.
- W2103283457 hasIssue "1" @default.
- W2103283457 hasLocation W21032834571 @default.
- W2103283457 hasOpenAccess W2103283457 @default.
- W2103283457 hasPrimaryLocation W21032834571 @default.
- W2103283457 hasRelatedWork W2051487156 @default.
- W2103283457 hasRelatedWork W2317200988 @default.
- W2103283457 hasRelatedWork W2351491280 @default.
- W2103283457 hasRelatedWork W2358668433 @default.
- W2103283457 hasRelatedWork W2371447506 @default.
- W2103283457 hasRelatedWork W2386767533 @default.
- W2103283457 hasRelatedWork W2390279801 @default.
- W2103283457 hasRelatedWork W2748952813 @default.
- W2103283457 hasRelatedWork W2899084033 @default.
- W2103283457 hasRelatedWork W303980170 @default.
- W2103283457 hasVolume "1" @default.
- W2103283457 isParatext "false" @default.
- W2103283457 isRetracted "false" @default.
- W2103283457 magId "2103283457" @default.
- W2103283457 workType "article" @default.