Hypertext Browsing and Probabilistic Network Searching

  • Giovanni V. Guardalben
  • Hi. T. Srl
Conference paper


As more and more hypertext systems become available, the concept of browsing in hypertexts is enriched of new features and capabilities. However, the end result of any browsing activity is always one or more paths over the hypertext network. Sometimes though, the discovery of the right path may be a difficult experience. Often, users know the ultimate target of their search, but they do not know how to get there. A tool, called path verifier, is proposed here that, step by step, monitors the existence of a path to the target. The features of this tool are complicated by the fact that users may non-deterministically jump to and from different link structures within the hypertext network. We interpret this inherent non-determinism by means of probability values attached as labels to the edges of the network graph. The problem of efficiently computing the probability of connecting any two nodes of the hypertext network is discussed in relation to the theory of network reliability.


Source Node Target Node Current Node Virtual Node Link Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AH74]
    Aho, A.V., Hopcroft, J.E. & Ullman, J.D., The design and analysis of computer algorithms, Addison-Wesley, 1974.Google Scholar
  2. [BU84]
    Buzacott, J.A. & Chang, J.S.K., Cut-set intersections and node partitions, IEEE Trans, on Reliability, Vol. R-33, No. 5, Dec. 1984.Google Scholar
  3. [CA79]
    Carre’, B., Graphs and networks, Oxford University Press, 1979.Google Scholar
  4. [CO87]
    Coulborn, C., The combinatorics of network reliability, Oxford University Press, 1987.Google Scholar
  5. [CON87]
    Conklin, J., Hypertext: an introduction and survey, Computer, Vol. 20, No. 9,Spet. l987.Google Scholar
  6. [CR88]
    Cruz, F.I. & Norvell, S.T., Aggregate closure: an extension of transitive closure, Tech. Report CSRI-212, University of Toronto, Sept. 1988.Google Scholar
  7. [GA86]
    Garrett, N.L., Smith, K.E. & Meyrowitz, N., Intermedia: issues, strategies, and tactics in the design of a hypermedia document system, Proceedings on Computer-Supported Cooperative Work, MCC Software Technology Program, Austin, Texas, 1986.Google Scholar
  8. [JA85]
    Jasmon, G.B., Cutset analysis of networks using basic minimal paths and network decomposition, IEEE Trans. on Reliability, Vol. R-34, No. 4, Oct. 1985.Google Scholar
  9. [MBB90]
    Moline, J., Benigni, D. & Baronas, J., Proceedings of the Hypertext Standardization Workshop, NIST Special Publication 500-178, Jan, 1990.Google Scholar
  10. [MC90]
    McHugh, J.A., Algorithmic graph theory, Prentice-Hall International Editions, 1990.Google Scholar
  11. [PA89]
    Parunak, H.V.D., Hypermedia topologies and user navigation, Proceedings of Hypertext’ 89, pp 43-50, 1989.Google Scholar
  12. [PO71]
    Polesskii, V.P., A lower boundary for the reliability of information networks, Problems of Information Transmission, 7, pp 165-171, 1971.Google Scholar
  13. [TR83]
    Trigg, R.H., A network-based approach to text handling for the Online Scientific Community, PHD. Thesis, University of Maryland, 1983.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Giovanni V. Guardalben
    • 1
  • Hi. T. Srl
    • 1
  1. 1.VeronaItaly

Personalised recommendations