PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Using web structure for classifying and describing web pages
Proceedings of the 11th international conference on World Wide Web
Web Site Optimization Using Page Popularity
IEEE Internet Computing
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Replicating Web Structure in Small-Scale Test Collections
Information Retrieval
Information Processing Letters
Modeling parametric web arc weight measurement
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Maximum rooted spanning trees for the web
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
| Hi-index | 0.00 |
The WWW can be viewed as digraph with Web nodes and arcs, where the Web nodes correspond to HTML files having page contents and the arcs correspond to hypertext links interconnected with the Web pages. The Web cycle resolution is one of the problems to derive a meaningful structure out of the complex WWW graphs. We formalize our view of the Web structure from Web as a graph approach to an algorithm in terms of proofing the repetitive cycles. We formalize the Web model that prevents the Web structuring algorithm from being bewildered by the repetitive cycles. The complexity of the corresponding algorithm has been addressed fairly enhanced than the previous approaches.