A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies Export

@article{citeulike:232595, abstract = {Hypermedia applications tend to use simple representations for navigation: most commonly, nodes are organized within an unconstrained graph, and users are presented with embedded links or lists of links. Recently, new data structures have emerged which may serve as alternative models for both the organization, and presentation, of hypertextual nodes and links. In this paper, we consider zzstructures, mSpaces, and polyarchies from the perspective of graph theory, and compare these models formally. The novel aspects of this work include: providing a sound, graph-theoretic analysis of zzstructures; the identi cation of a new class of polyarchies associated with mSpaces; and the comparison and classi- cation of these and other structures within a taxonomy. The taxonomy that results from our comparison allows us to consider, rst, what the distinct characteristics of each model are at a fundamental level, and second, what model or attributes of a model may be most appropriate for the design goals of a given hypermedia application.}, address = {Santa Cruz, California, USA}, author = {Mcguffin, M. and Schraefel, M.}, citeulike-article-id = {232595}, citeulike-linkout-0 = {http://eprints.ecs.soton.ac.uk/9230/}, journal = {Proceedings of ACM Conference on Hypertext and Hypermedia,}, keywords = {graphs, hyperstructure}, organization = {ACM}, pages = {153--162}, posted-at = {2005-06-20 18:31:36}, priority = {3}, title = {A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies}, url = {http://eprints.ecs.soton.ac.uk/9230/}, year = {2004} }

TY - JOUR ID - citeulike:232595 L3 - citeulike-article-id:232595 N2 - Hypermedia applications tend to use simple representations for navigation: most commonly, nodes are organized within an unconstrained graph, and users are presented with embedded links or lists of links. Recently, new data structures have emerged which may serve as alternative models for both the organization, and presentation, of hypertextual nodes and links. In this paper, we consider zzstructures, mSpaces, and polyarchies from the perspective of graph theory, and compare these models formally. The novel aspects of this work include: providing a sound, graph-theoretic analysis of zzstructures; the identi cation of a new class of polyarchies associated with mSpaces; and the comparison and classi- cation of these and other structures within a taxonomy. The taxonomy that results from our comparison allows us to consider, rst, what the distinct characteristics of each model are at a fundamental level, and second, what model or attributes of a model may be most appropriate for the design goals of a given hypermedia application. JF - Proceedings of ACM Conference on Hypertext and Hypermedia, OR - ACM AD - Santa Cruz, California, USA EP - 162 TI - A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies SP - 153 KW - graphs KW - hyperstructure AU - Mcguffin, M AU - Schraefel, M PY - 2004/// UR - http://eprints.ecs.soton.ac.uk/9230/ ER -