Sorting and recognition problems for ordered sets

  • Ulrich Faigle
  • György Turán
Conference paper

DOI: 10.1007/BFb0024000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)
Cite this paper as:
Faigle U., Turán G. (1985) Sorting and recognition problems for ordered sets. In: Mehlhorn K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg

Abstract

How many questions are needed to identify an unknown ordered set which, however, is known to be isomorphic to a given "pattern" ordered set Po? This generalization of sorting is discussed together with related computational problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Ulrich Faigle
    • 1
  • György Turán
    • 1
  1. 1.Inst. f. Operations ResearchUniv. BonnGermany

Personalised recommendations