Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics

ACM Transactions on Information Systems (TOIS)

Volumn 10, Issue 2, 1992, Pages 142-180

  Botafogo, Rodrigo A ^a   Rivlin, Ehud ^b   Shneiderman, Ben ^b  

^a NEC CORPORATION   (Japan)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

graph theory; hierarchies; hypertext; metrics; structural analysis

Indexed keywords

COMPUTER NETWORKS; DATA REDUCTION; DATA STRUCTURES; GRAPH THEORY; HIERARCHICAL SYSTEMS; HUMAN ENGINEERING; MAN MACHINE SYSTEMS; USER INTERFACES;

HYPERTEXT SYSTEMS; METRICS;

INFORMATION RETRIEVAL;

EID: 0026845595     PISSN: 10468188     EISSN: 15582868     Source Type: Journal    
DOI: 10.1145/146802.146826     Document Type: Article

References (30)

1. BOTAFOGO, R. A. Structural analysis of hypertexts. Unpublished Master's Thesis, Univ. of Maryland, College Park, 1990.
2. BOTAFOGO, R. A., AND SHNEIDERMAN, B. Identifying aggregates in hypertext structures. In Proceedings of the Hypertext ‘91 Conference. ACM, New York, 1991, pp. 63-74.
3. BROWN, P. J. DO we need maps to navigate round hypertext documents? Electron. Publishing, 2 2 (1989), 91-100.
4. CHARNEY, D. Comprehending non-linear text: The role of discourse cues and reading strategies. In Proceedings of the Hypertext ‘87 Conference (Charlotte, N.C., Nov. 13-15, 1987). ACM, New York, 1987, pp. 109-120.
5. CONKLIN, J., AND BEGEMAN, M. gIBIS: A tool for exploratory policy discussion, ACM Trans Office Inf. Syst. 6, 4 (1988), 303-331.
6. EGAN, D. E., REMDE, J. R., GOMEZ, L. M., LANDAUER, T. K., EBERHARDT, J., AND LOCHBLM, C. C. Formative design-evaluation of SuperBook, ACM Trans. Inf. Syst. 7, 1 (1989), 30-57
7. FLOYD, R. W. Algorithm 97: Shortest path Commun. ACM., 5 6 (1962), 345
8. FURNAS, G. W. Generalized fisheye views. In Proceedings of the CHI ‘86 Conference (Boston, Apr. 13-17, 1986) ACM, New York, 1986, pp. 16-23.
9. HALASZ, F. G., MORAN, T. P., AND TRIGG, R. H. NoteCards in a nutshell In Proceedings of the ACM CHI + GI ‘87 Conference (Toronto, Ont., Apr. 5-9, 1987). ACM, New York, 1987, pp 45-52
10. HALASZ, F. G. Reflection on NoteCards: Seven issues for the next generation of hypermedia systems. Commun. ACM, 31 7 (1988), 836-852
11. HARARY, F. Status and contrastatus Sociometry 22 (1959), 23-43.
12. HARARY, F., NORMAN, R. Z., AND CARTWRIGHT, D. Structural models. An Introduction to the Theory of Directed Graphs. Wiley, New York, 1965
13. KAUFMANN, A. Graphs, dynamic programming and finite games. In Mathematics in Science and Engineering 36. Academic Press, New York 1967.
14. KINTSCH, W., AND VAN DIJK, T. Toward a model of text comprehension and production Psychol. Rev. 85 (1978), 363-394.
15. MARSHALL, C. C. Guided Tours and on-line presentations: How authors make existing hypertext intelligible for readers. In Proceedings of the Hypertext ‘89 Conference (Pittsburgh, Pa., Nov. 5-8, 1989). ACM, New York, 1989, pp. 15-26.
16. MOFFAT, A. AND TAKAOKA, T. An all pairs shortest path algorithm with expected running time O(n2 log n). In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 101-105.
17. NIELSEN, J. The art of navigating through hypertext Commun. ACM, 33 3 (1990), 296-310.
18. NIELSEN, J. Hypertext & Hypermedia. Academic Press, New York, 1990.
19. NEUWIRTH, C., KAUFER, D., CHIMERA, R., AND TERILYN, G. The notes program: A hypertext application for writing from source texts In Proceedings of the Hypertext ‘87 Conference, ACM, New York, 1987, pp. 121-135.
20. PAUSCH, R., AND DETMER, J. Node popularity as a hypertext browsing aid. Electron. Publishing. Original Dissemination Des., 3 4 (1990), pp. 227-234.
21. PLAISANT, C. Guide to Opportunities in volunteer archaeology-Case study of the use of a hypertext system in a museum exhibit. In Hypertext/Hypermedia Handbook, E. Berk and J. Devlin, Eds., McGraw-Hill, New York, 1991, pp. 498-505.
22. SALTON, G. Automatic Text Processing. Addison-Wesley, Reading, Mass., 1989.
23. SHNEIDERMAN, B., AND KEARSLEY, G. Hypertext Hands-On! Addison-Wesley, Reading, Mass., 1989.
24. SIRA, P. M. A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2 log2 n), SIAM J. Comput., 2 1 (1973), 28-32.
25. STOTTS, P. D., AND FURUTA, R. Petri-net-based hypertext: Document structure with browsing semantics ACM Trans Inf Syst. 7, 1 (1989), 3-29
26. STOTTS, P. D., AND FURUTA, R. Hierarchy, composition, scripting languages, and translators for structure hypertext. In Proceedings of the European Conference on Hypertext (Paris, 1990) pp. 180-193.
27. TRIGG, R., AND IRISH, P. Hypertext habitats: Experiences of writers in NoteCards In Proceedings of the Hypertext ‘87 Conference (Charlotte, N.C., Nov 13-15, 1987) ACM, New York, 1987, pp. 89-108
28. VALDEZ, F., AND CHIGNELL, M. Browsing models for hypermedia databases. In Proceedings of the Human Factors Society, 32nd Annual Meeting (Santa Monica, Calif., 1988), Human Factors Society, 1988, pp. 318-322.
29. VAN DIJK, T., AND KINTSCH, W. Strategies of Discourse Comprehension. Academic Press, New York, 1983.
30. ZELLWEGER. P. T. Scripted documents: A hypermedia path mechanism In Proceedings of Hypertext ‘89 Conference (Pittsburgh, Pa., Nov. 5-8, 1989). ACM, New York, 1989. pp. 1-14