ACM Home Page
Please provide us with feedback. Feedback
Browsing intricately interconnected paths
Full text PdfPdf (646 KB)
Source Conference on Hypertext and Hypermedia archive
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia table of contents
Nottingham, UK
SESSION: Link aggregation table of contents
Pages: 95 - 103  
Year of Publication: 2003
ISBN:1-58113-704-4
Authors
Pratik Dave  Texas A&M University, College Station, TX
Unmil P. Karadkar  Texas A&M University, College Station, TX
Richard Furuta  Texas A&M University, College Station, TX
Luis Francisco-Revilla  Texas A&M University, College Station, TX
Frank Shipman  Texas A&M University, College Station, TX
Suvendu Dash  Texas A&M University, College Station, TX
Zubin Dalal  Texas A&M University, College Station, TX
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 23,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/900051.900071
What is a DOI?

ABSTRACT

Graph-centric and node-centric browsing are the two commonly identified hypertext-browsing paradigms. We believe that path-centric browsing, the browsing behavior exhibited by path interfaces, is an independent browsing paradigm that combines useful aspects of the two commonly supported cases. Paths have long been recognized as an effective medium for aggregating and communicating information and have been included in various hypermedia systems as alternate metaphors or supporting tools. The Walden's Paths project promotes path-centric traversal as the primary browsing mechanism over Web-based materials. This paper expands the notion of our paths to include more generalized structures and interconnections across paths. We present an architecture for describing complex networks of such paths. Finally, we discuss the design and present a prototype implementation of the Path Engine, a tool that provides a linear interface for browsing intricately interconnected paths.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Bush, V. As We May Think. In The Atlantic Monthly, 176(1) (July 1945), 101--108.
 
5
6
7
8
 
9
Engelbart, D.C. Authorship Provisions in Augment. In Proceedings of IEEE COMPCOM '84 (Spring 1984), 465--472.
10
11
12
13
14
 
15
Joyce, M. afternoon, a story. Eastgate Systems, Inc., Watertown, MA, 1990.
16
17
18
19
20
21
 
22
Nelson, T.H. ZigZag. In Proceedings of the twelfth ACM conference on Hypertext and hypermedia, Hypertext '01 (Århus Denmark, August 2001), ACM Press, 261--262.
23
24
25
26
27
 
28
29
30
31
32
 
33
 
34
Zellweger, P.T. Directed Paths Through Collections of Multimedia Documents. In Proceedings of the ACM conference on Hypertext, Hypertext '87 (New York NY, November 1987), ACM Press, Position paper.
35

CITED BY  8

Collaborative Colleagues:
Pratik Dave: colleagues
Unmil P. Karadkar: colleagues
Richard Furuta: colleagues
Luis Francisco-Revilla: colleagues
Frank Shipman: colleagues
Suvendu Dash: colleagues
Zubin Dalal: colleagues