Skip to main content

Algebraic Visualization of Relations Using RelView

  • Conference paper

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

Abstract

For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. This means rearranging the matrix appropriately, permuting rows and columns simultaneously or independently as required. In this way, many complex situations may successfully be handled in various application fields. We show how relation algebra and RelView can be combined to solve such tasks.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Behnke, R., et al.: ReLView – A system for calculation with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 318–321. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Berghammer, R., Hoffmann, T.: Modelling sequences within the RelView system. J. Universal Comput. Sci. 7, 107–123 (2001)

    MATH  MathSciNet  Google Scholar 

  3. Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relation algebra using binary decision diagrams. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 241–257. Springer, Heidelberg (2002)

    Chapter  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)

    Chapter  Google Scholar 

  5. Bona, M.: A walk through combinatorics: An introduction to combinatorics and graph theory. World Scientific Publishing, Singapore (2002)

    MATH  Google Scholar 

  6. Colorni, A., Paruccini, M., Roy, B.: A-MCD-A – Multiple criteria decision aiding. Joint Research Centre of the European Commission (2001)

    Google Scholar 

  7. de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.): Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  8. de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.): Theory and Applications of Relational Structures as Knowledge Instruments II. LNCS (LNAI), vol. 4342. Springer, Heidelberg (2006)

    Google Scholar 

  9. di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph drawing – Algorithms for the visualization of graphs. Prentice-Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  10. Fishburn, P.: On the construction of weak orders from fragmentary information. Psychometrika 38, 459–472 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fishburn, P.: Interval orders and interval graphs. Wiley, Chichester (1985)

    MATH  Google Scholar 

  12. Guttmann, L.: A basis for scaling qualitative data. American Sociological Review 9, 139–150 (1944)

    Article  Google Scholar 

  13. Gansner, E.R., North, S.C., Vo, K.P.: DAG – A program that draws directed graphs. Software – Practice and Experience 17, 1047–1062 (1988)

    Article  Google Scholar 

  14. Ganter, B., Wille, R.: Formal concept analysis. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  15. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Proc. Letters 31, 7–15 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  17. Öztürk, M., Tsoukias, A., Vincke, P.: Preference modelling. In: Ehrgott, M., Greco, S., Figueira, J. (eds.) Multiple criteria decision analysis: State of the art surveys. Int. Series in Operat. Res. and Manag. Sci, vol. 78, pp. 27–71. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Schmidt, G., Ströhlein, T.: Relationen und Graphem. Springer. Available also in English: Relations and graphs. In: EATCS Monographs on Theoret. Comput. Sci., Springer, Heidelberg (1993)

    Google Scholar 

  19. Scott, D., Suppes, P.: Foundational aspects of the theories of measurement. J. Symbolic Logic 23, 113–128 (1958)

    Article  MathSciNet  Google Scholar 

  20. Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fund. Math. 16, 386–389 (1930)

    MATH  Google Scholar 

  21. Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Victor G. Ganzha Ernst W. Mayr Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berghammer, R., Schmidt, G. (2007). Algebraic Visualization of Relations Using RelView . In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2007. Lecture Notes in Computer Science, vol 4770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75187-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75187-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75186-1

  • Online ISBN: 978-3-540-75187-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics