Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

CompleteGraphSort is a complete graph structure based new sorting algorithm

From MaRDI portal
Publication:4614850
Jump to:navigation, search

zbMATH Open1413.68026MaRDI QIDQ4614850FDOQ4614850


Authors: Rajat Kumar Pal Edit this on Wikidata


Publication date: 31 January 2019


Full work available at URL: https://camo.ici.ro/journal/vol15/v15a11.pdf




Recommendations

  • Sorting an array using the topological sort of a corresponding comparison graph
  • scientific article; zbMATH DE number 3928360
  • scientific article; zbMATH DE number 1827438
  • Sorting with networks of data structures
  • scientific article; zbMATH DE number 2219109


zbMATH Keywords

graphalgorithmcomplexitysortingsatellite datarecordcomparison sort


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)



Cited In (3)

  • 2 mm: a new technique for sorting data
  • CompleteGraphSort
  • Sorting an array using the topological sort of a corresponding comparison graph

Uses Software

  • RKPianGraphSort





This page was built for publication: CompleteGraphSort is a complete graph structure based new sorting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614850)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4614850&oldid=18777268"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 14:09. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki