Navigation in Hypertext Is Easy Only Sometimes

DOI10.1137/S0097539795282730MaRDI QIDQ4943843zbMATH OpenOpenAlexFDO

Authors M. Levene, George Loizou

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539795282730

zbMATH Keywords

computational complexityfinite automataHypertextnavigationtemporal logictrail query

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A probabilistic approach to navigation in Hypertext
• scientific article; zbMATH DE number 994423
• Pattern matching in hypertext
• scientific article; zbMATH DE number 196128
• scientific article; zbMATH DE number 49262

Cited in

(7)

• Algorithmic navigation in hypertext network as a means for generation of discourse texts
• A probabilistic approach to navigation in Hypertext
• scientific article; zbMATH DE number 1755759 (Why is no real title available?)
• scientific article; zbMATH DE number 2086669 (Why is no real title available?)
• Graphic and numerical methods to assess navigation in hypertext
• Pattern matching in hypertext
• Hypertext searching -- a survey

This page was built for publication: Navigation in Hypertext Is Easy Only Sometimes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943843)