Graph pairs and their entropies: Modularity problems

Combinatorica

Volumn 20, Issue 2, 2000, Pages 227-240

  Körner, János ^a   Simonyi, Gábor ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034355242     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070022     Document Type: Article

References (14)

1. I. CSISZÁR, J. KÖRNER: Information theory: Coding theorems for discrete memoryless systems, Academic Press, New York, 1982 and Akadémiai Kiadó, Budapest, 1981.
2. I. CSISZÁR, J. KÖRNER, L. LOVÁSZ, K. MARTON, G. SIMONYI: Entropy splitting for antiblocking pairs and perfect graphs, Combinatorica, 10 (1) (1990), 27-40.
3. T. GALLAI: Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar. 18 (1967), 25-66.
4. J. KAHN, J. H. KIM: Entropy and sorting, J. Computer and System Sciences, 51 (1995), 390-399.
5. D. KELLY: Comparability graphs, in: Graphs and Orders (I. Rival ed.), D. Reidel Publ. Co. (1985), 3-40.
6. J. KÖRNER: Coding of an information source having ambiguous alphabet and the entropy of graphs, Transactions of the 6th Prague conference on Information Theory, etc., 1971, Academia, Prague, (1973), 411-425.
7. J. KÖRNER, G. LONGO: Two-step encoding of finite sources, IEEE Trans. Inform. Theory, 19, Nov. 1973, 778-782.
8. J. KÖRNER: Fredman-Komlós bounds and information theory, SIAM J. Algebraic and Discrete Methods, 7 (4), (1986), 560-570.
9. J. KÖRNER, K. MARTON: Graphs that split entropies, SIAM J. Discrete Math., 1 (1), (1988), 71-79.
10. J. KÖRNER, K. MARTON: New bounds for perfect hashing via information theory, European J. Combinatorics, 9 (1988), 523-530.
11. J. KÖRNER, G. SIMONYI, ZS. TUZA: Perfect couples of graphs, Combinatorica, 12 (2) (1992), 179-192.
12. J. RADHAKRISHNAN: ΣΠΣ threshold formulas, Combinatorica, 14 (3) (1994), 345-374.
13. G. SIMONYI: Graph entropy: a survey, in: Combinatorial Optimization, DIMACS Series on Discrete Math, and Computer Science Vol. 20 (W. Cook, L. Lovász, P. D. Seymour eds.), AMS, 1995, 399-441.
14. G. SIMONYI: Entropy splitting hypergraphs, J. Combin. Theory Ser. B 66 (1996), 310-323.