메뉴 건너뛰기




Volumn 190, Issue 2, 2007, Pages 1783-1794

Information theoretic measures of UHG graphs with low computational complexity

Author keywords

Entropy; Graph classes; Graph measures; Hierarchical graphs; Information theory

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; INFORMATION THEORY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

EID: 34250623666     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.02.095     Document Type: Article
Times cited : (34)

References (30)
  • 2
    • 34250640850 scopus 로고    scopus 로고
    • L. Babai, Automorphism groups, isomorphism, reconstruction. Technical report, Chicago, IL, USA, 1994.
  • 3
    • 0018708291 scopus 로고    scopus 로고
    • L. Babai, L. Kucera, Canonical labelling of graphs in linear average time, in: Proceedings 20th IEEE Symposium on Foundations of Computer Science (FOCS), 1979. pp. 39-46.
  • 6
    • 20744440332 scopus 로고    scopus 로고
    • Inferring genetic regulatory logic from expression data
    • Bulashevska S., and Eils R. Inferring genetic regulatory logic from expression data. Bioinformatics 21 (2005) 2706-2713
    • (2005) Bioinformatics , vol.21 , pp. 2706-2713
    • Bulashevska, S.1    Eils, R.2
  • 7
    • 34250648632 scopus 로고    scopus 로고
    • A. Caley, On the analytical forms called trees, with application to the theory of chemical combinatorics. Report of the British Association for the Advancement of Science, 1875. pp. 257-305.
  • 9
    • 84860218108 scopus 로고    scopus 로고
    • Strukturelle Analyse Web-basierter Dokumente
    • Lehner F., and Bodendorf F. (Eds), Wissenschaft-Deutscher Universitätsverlag
    • Dehmer M. Strukturelle Analyse Web-basierter Dokumente. In: Lehner F., and Bodendorf F. (Eds). Multimedia und Telekooperation. Gabler ed. (2006), Wissenschaft-Deutscher Universitätsverlag
    • (2006) Multimedia und Telekooperation. Gabler ed.
    • Dehmer, M.1
  • 12
    • 49749142261 scopus 로고    scopus 로고
    • F. Emmert-Streib, M. Dehmer, J. Kilian, Classification of large graphs by a local tree decomposition, in: H.R. Arabnia, A. Scime, (Eds.), Proceedings of the 2005 International Conference on Data Mining (DMIN'05), 2005. pp. 200-207.
  • 14
    • 85053487806 scopus 로고
    • Status and contrastatus
    • Harary F. Status and contrastatus. Sociometry 22 (1959) 23-43
    • (1959) Sociometry , vol.22 , pp. 23-43
    • Harary, F.1
  • 18
    • 0001460788 scopus 로고
    • A note on the graph isomorphism counting problem
    • Mathon R. A note on the graph isomorphism counting problem. Information Processing Letters 8 (1979) 131-132
    • (1979) Information Processing Letters , vol.8 , pp. 131-132
    • Mathon, R.1
  • 20
    • 33744831759 scopus 로고    scopus 로고
    • Towards logical hypertext structure. A graph-theoretic perspective
    • Proceedings of I2CS'04, Springer, Berlin-New York
    • Mehler A., Dehmer M., and Gleim R. Towards logical hypertext structure. A graph-theoretic perspective. Proceedings of I2CS'04. Lecture Notes (2005), Springer, Berlin-New York 136-150
    • (2005) Lecture Notes , pp. 136-150
    • Mehler, A.1    Dehmer, M.2    Gleim, R.3
  • 22
    • 0014257683 scopus 로고
    • Entropy and the complexity of graphs: I. an index of the relative complexity of a graph
    • Mowshowitz A. Entropy and the complexity of graphs: I. an index of the relative complexity of a graph. Bulletin of Mathematical Biophysics 30 (1968) 175-204
    • (1968) Bulletin of Mathematical Biophysics , vol.30 , pp. 175-204
    • Mowshowitz, A.1
  • 23
    • 0014296467 scopus 로고
    • Entropy and the complexity of graphs: Ii. The information content of digraphs and infinite graphs
    • Mowshowitz A. Entropy and the complexity of graphs: Ii. The information content of digraphs and infinite graphs. Bulletin of Mathematical Biophysics 30 (1968) 225-240
    • (1968) Bulletin of Mathematical Biophysics , vol.30 , pp. 225-240
    • Mowshowitz, A.1
  • 24
    • 51249190020 scopus 로고
    • Entropy and the complexity of graphs: Iii. graphs with prescribed informationn content
    • Mowshowitz A. Entropy and the complexity of graphs: Iii. graphs with prescribed informationn content. Bulletin of Mathematical Biophysics 30 (1968) 387-414
    • (1968) Bulletin of Mathematical Biophysics , vol.30 , pp. 387-414
    • Mowshowitz, A.1
  • 25
    • 51249189854 scopus 로고
    • Entropy and the complexity of graphs: Iv. entropy measures and graphical structure
    • Mowshowitz A. Entropy and the complexity of graphs: Iv. entropy measures and graphical structure. Bulletin of Mathematical Biophysics 30 (1968) 533-546
    • (1968) Bulletin of Mathematical Biophysics , vol.30 , pp. 533-546
    • Mowshowitz, A.1
  • 29
    • 0037270514 scopus 로고    scopus 로고
    • Towards reconstruction of gene networks from expression data by supervised learning
    • Soinov L.A., Krestyaninova M.A., and Brazma A. Towards reconstruction of gene networks from expression data by supervised learning. Genome Biology 4 1 (2003) R6
    • (2003) Genome Biology , vol.4 , Issue.1
    • Soinov, L.A.1    Krestyaninova, M.A.2    Brazma, A.3
  • 30
    • 51649221175 scopus 로고
    • A note on the information content of graphs
    • Trucco E. A note on the information content of graphs. Bulletin of Mathematical Biophysics 18 (1956) 129-135
    • (1956) Bulletin of Mathematical Biophysics , vol.18 , pp. 129-135
    • Trucco, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.