Skip to main content
SpringerLink
Log in
Book cover

International Conference on Relational and Algebraic Methods in Computer Science

RAMiCS 2021: Relational and Algebraic Methods in Computer Science pp 72–89Cite as

Experimental Investigation of Sufficient Criteria for Relations to Have Kernels

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13027))

Abstract

We investigate four well-known criteria for the existence of kernels in directed graphs/relations which can be tested efficiently, viz. to be irreflexive and symmetric, to be progressively finite, to be bipartite and to satisfy Richardson’s criterion. The numerical data, obtained by the evaluation of relation-algebraic problem specifications using RelView  show that even the most general of them is very far away from a characterisation of the class of directed graphs/relations having kernels.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Berge, C., Duchet, P.: Recent problems and results aboutkernels in directed graphs. Disc. Math. 86, 27–31 (1990)

    Article  Google Scholar 

  2. Berghammer, R., Hoffmann, T.: Deriving relational programs for computing kernels by reconstructing a proof of Richardson’s theorem. Sci. Comput. Program. 38, 1–25 (2000)

    Article  MathSciNet  Google Scholar 

  3. Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relational algebra using binary decision diagrams. In: de Swart, H.C.M. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 241–257. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36280-0_17

    Chapter  MATH  Google Scholar 

  4. Berghammer, R., Neumann, F.: RelView – an OBDD-based computer algebra system for relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 40–51. Springer, Heidelberg (2005). https://doi.org/10.1007/11555964_4

    Chapter  MATH  Google Scholar 

  5. Chvatal, V.: On the computational complexity of finding a kernel. Technical report CRM-300, Centre de Recherche Mathématiques, Université de Montréal (1973)

    Google Scholar 

  6. Davis, A.C.: A characterization of complete lattices. Pac. J. Math. 5(2), 311–319 (1955)

    Article  MathSciNet  Google Scholar 

  7. Dedekind, R.: Über die von drei Moduln erzeugte Dualgruppe. Mathematische Annalen 53(1), 371–403 (1900)

    Article  MathSciNet  Google Scholar 

  8. König, D.: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen 77, 453–465 (1916)

    Article  MathSciNet  Google Scholar 

  9. Kuratowski, K.: Sur le probleme des courbes gauches en topologie. Fundamenta Mathematicae 15(1), 271–283 (1930)

    Article  MathSciNet  Google Scholar 

  10. Richardson, M.: Solutions of irreflexive relations. Ann. Math. 58(3), 573–590 (1953)

    Article  MathSciNet  Google Scholar 

  11. Schmidt, G., Ströhlein, T.: Relations and Graphs. Springer, Heidelberg (1993). https://doi.org/10.1007/978-3-642-77968-8

    Book  MATH  Google Scholar 

  12. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285–309 (1955)

    Article  MathSciNet  Google Scholar 

  13. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Bevaviour. Princeton University Press, Princeton (1944)

    MATH  Google Scholar 

  14. https://www.rpe.informatik.uni-kiel.de/en/research/relview (homepage of Rel View)

  15. https://github.com/relview (source code of Rel View)

  16. https://zenodo.org/record/4708085#.YICAmS0RppR (virtual machine for Rel View)

Download references

Acknowledgment

We thank the referees for their very helpful comments and suggestions.

Author information

Authors and Affiliations

  1. Department of Computer Science, Kiel University, Kiel, Germany

    Rudolf Berghammer & Mitja Kulczynski

Authors
  1. Rudolf Berghammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitja Kulczynski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rudolf Berghammer .

Editor information

Editors and Affiliations

  1. École polytechnique, Palaiseau, France

    Uli Fahrenberg

  2. Université Côte d’Azur, Nice, France

    Mai Gehrke

  3. Aix-Marseille University, Marseille, France

    Luigi Santocanale

  4. Brock University, St Catharines, ON, Canada

    Michael Winter

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Berghammer, R., Kulczynski, M. (2021). Experimental Investigation of Sufficient Criteria for Relations to Have Kernels. In: Fahrenberg, U., Gehrke, M., Santocanale, L., Winter, M. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2021. Lecture Notes in Computer Science(), vol 13027. Springer, Cham. https://doi.org/10.1007/978-3-030-88701-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88701-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88700-1

  • Online ISBN: 978-3-030-88701-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation