Advertisement

Sorting and recognition problems for ordered sets

  • Ulrich Faigle
  • György Turán
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)

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.

Keywords

Boolean Algebra Identification Algorithm Recognition Problem Ternary Tree Unique Maximal Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Bollobás [1978]: Extremal Graph Theory, Academic Press.Google Scholar
  2. G. Hetyei [1964]: unpublished.Google Scholar
  3. D. Kelly [1981]: On the dimension of partially ordered sets, Discr. Math. 35, 135–156.Google Scholar
  4. D.E. Knuth [1973]: The Art of Computer Programming, Vol. 3, Addison Wesley, Reading MA.Google Scholar
  5. N. Linial and M.E. Saks [1983]: Information bounds are good for search problems on ordered structures, 24th IEEE FOCS, 473–475.Google Scholar
  6. L. Lovász [1979]: Combinatorial Problems and Exercises, Akadémiai Kiadó.Google Scholar
  7. I. Rabinovitch and I. Rival [1979]: The rank of a distributive lattice, Discr. Math. 25, 275–279.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

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

Personalised recommendations