Skip to main content
SpringerLink
Log in

Graph Pairs and their Entropies: Modularity Problems

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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

Author information

Authors and Affiliations

  1. Department of Computer Science, Università ''La Sapienza''; 00198 Roma, Italy; E-mail: korner@dsi.uniroma1.it, , , , , , IT

    János Körner

  2. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences; H-1364 Budapest, P.O.B. 127, Hungary; E-mail: simonyi@renyi.hu, , , , , , HU

    Gábor Simonyi

Authors
  1. János Körner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Simonyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received June 24, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Körner, J., Simonyi, G. Graph Pairs and their Entropies: Modularity Problems. Combinatorica 20, 227–240 (2000). https://doi.org/10.1007/s004930070022

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930070022

Search

Navigation