Matches in SemOpenAlex for { <https://semopenalex.org/work/W2085352601> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2085352601 endingPage "294" @default.
- W2085352601 startingPage "279" @default.
- W2085352601 abstract "The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering (also called a generalized sorted sequence) for any intransitive total ordered set, or equivalently, the existence of a Hamiltonian path in a tournament. A new data structure called semi-heap is proposed to construct an optimal Θ(n log n) sorting algorithm. We also provide a cost-optimal parallel algorithm using semi-heap. The run time of this algorithm is Θ(n) with Θ( log n) processors under the EREW PRAM model. The use of a Hamiltonian path (generalized sorting sequence) as an approximation of a ranking system in a tournament is also discussed." @default.
- W2085352601 created "2016-06-24" @default.
- W2085352601 creator A5047253189 @default.
- W2085352601 date "2000-12-01" @default.
- W2085352601 modified "2023-09-26" @default.
- W2085352601 title "ON FINDING A HAMILTONIAN PATH IN A TOURNAMENT USING SEMI-HEAP" @default.
- W2085352601 cites W2024385930 @default.
- W2085352601 cites W2033472258 @default.
- W2085352601 cites W2037100948 @default.
- W2085352601 cites W2090657494 @default.
- W2085352601 doi "https://doi.org/10.1142/s0129626400000275" @default.
- W2085352601 hasPublicationYear "2000" @default.
- W2085352601 type Work @default.
- W2085352601 sameAs 2085352601 @default.
- W2085352601 citedByCount "2" @default.
- W2085352601 countsByYear W20853526012021 @default.
- W2085352601 crossrefType "journal-article" @default.
- W2085352601 hasAuthorship W2085352601A5047253189 @default.
- W2085352601 hasConcept C108094655 @default.
- W2085352601 hasConcept C111696304 @default.
- W2085352601 hasConcept C11413529 @default.
- W2085352601 hasConcept C114614502 @default.
- W2085352601 hasConcept C118615104 @default.
- W2085352601 hasConcept C134757568 @default.
- W2085352601 hasConcept C136975688 @default.
- W2085352601 hasConcept C311688 @default.
- W2085352601 hasConcept C33923547 @default.
- W2085352601 hasConceptScore W2085352601C108094655 @default.
- W2085352601 hasConceptScore W2085352601C111696304 @default.
- W2085352601 hasConceptScore W2085352601C11413529 @default.
- W2085352601 hasConceptScore W2085352601C114614502 @default.
- W2085352601 hasConceptScore W2085352601C118615104 @default.
- W2085352601 hasConceptScore W2085352601C134757568 @default.
- W2085352601 hasConceptScore W2085352601C136975688 @default.
- W2085352601 hasConceptScore W2085352601C311688 @default.
- W2085352601 hasConceptScore W2085352601C33923547 @default.
- W2085352601 hasIssue "04" @default.
- W2085352601 hasLocation W20853526011 @default.
- W2085352601 hasOpenAccess W2085352601 @default.
- W2085352601 hasPrimaryLocation W20853526011 @default.
- W2085352601 hasRelatedWork W1516328423 @default.
- W2085352601 hasRelatedWork W1976560320 @default.
- W2085352601 hasRelatedWork W1993929586 @default.
- W2085352601 hasRelatedWork W2085352601 @default.
- W2085352601 hasRelatedWork W2373817572 @default.
- W2085352601 hasRelatedWork W2472530396 @default.
- W2085352601 hasRelatedWork W2912068108 @default.
- W2085352601 hasRelatedWork W4313031064 @default.
- W2085352601 hasRelatedWork W4320085741 @default.
- W2085352601 hasRelatedWork W4360618233 @default.
- W2085352601 hasVolume "10" @default.
- W2085352601 isParatext "false" @default.
- W2085352601 isRetracted "false" @default.
- W2085352601 magId "2085352601" @default.
- W2085352601 workType "article" @default.