A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties

  • A. Goralčíková
  • P. Goralčík
  • V. Koubek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Complete Lattice Homomorphic Image Unary Algebra Simple Semigroup Graph Isomorphism 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Babai: Moderately exponential bound for graph isomorphism, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 34–50.Google Scholar
  2. [2]
    K. S. Booth: Isomorphism testing for graphs, semigroups and finite automata are polynomially equivalent problems, SIAM J. Comput. 7 (1978), 273–279.MathSciNetCrossRefGoogle Scholar
  3. [3]
    K. S. Booth, Ch. J. Colbourn: Problems polynomially equivalent to graph isomorphism, Tech. Rep. CS-77-04, Univ. of Waterloo, 1979.Google Scholar
  4. [4]
    N. Christofides: Graph theory, an algorithmic approach, Acad. Press, New York, London, San Francisco, 1975.zbMATHGoogle Scholar
  5. [5]
    A. H. Clifford, G. B. Preston: The algebraic theory of semigroups, AMS, Providence, Rhode Island, 1967.zbMATHGoogle Scholar
  6. [6]
    L. Kučera, V. Trnková: Isomorphism completeness for some algebraic structures, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 218–225.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • A. Goralčíková
    • 1
  • P. Goralčík
    • 1
  • V. Koubek
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPraha 1Russia

Personalised recommendations