Skip to main content
SpringerLink
Log in

On best transitive approximations to simple graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

In this paper, we investigate both combinatorial and complexity aspects of the problem of finding best transitive approximations to simple graphs. These problems are addressed in an interlocked way. We provide new and simple proofs of known results and in addition prove some new theorems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blum, N. (1990) A new approach to maximum matchings in general graphs. In: Paterson, M. (ed.) ICALP 90: Automata, Languages and Programming (LNCS 443) 17: 586-597

  2. De Clercq, R., Horsten, L. Closer. Synthese (to appear)

  3. Garey, M.R., Johnson, D.S., Stockmeyer, L. (1976) Some simplified NP-complete graph problems. Theoretical Computer Science 1: 237-267

    Article  MATH  Google Scholar 

  4. Krantz, S. (2002) Logic and proof techniques for computer science. Birkhäuser

  5. Krivanek, M., Moravek, J. (1986) NP-hard problems in hierarchical tree-clustering. Acta Informatica 23: 311-323

    MathSciNet  MATH  Google Scholar 

  6. Moon, J.W. (1966) A note on approximating symmetric relations by equivalence classes. SIAM Journal of Applied Mathematics 14: 226-227

    MATH  Google Scholar 

  7. Tomescu, I. (1974) La réduction minimale d’un graphe á une réunion de cliques. Discrete Mathematics 10: 173-179

    Article  MATH  Google Scholar 

  8. Williamson, T. (1986) Criteria of identity and the axiom of choice. Journal of Philosophy 83: 380-394

    MathSciNet  Google Scholar 

  9. Williamson, T. (1990) Identity and discrimination. Blackwell

  10. Zahn, C.T., Jr. (1964) Approximating symmetric relations by equivalence relations. SIAM Journal of Applied Mathematics 12: 840-847

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science/Department of Philosophy, University of Leuven, 3000, Leuven, Belgium

    Steven Delvaux & Leon Horsten

Authors
  1. Steven Delvaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leon Horsten
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 16 April 2003, Published online: 8 July 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delvaux, S., Horsten, L. On best transitive approximations to simple graphs. Acta Informatica 40, 637–655 (2004). https://doi.org/10.1007/s00236-004-0144-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-004-0144-0

Keywords

Search

Navigation