Maximum rooted spanning trees for the web

Authors:
Wookey Lee;Seungkil Lim
Affiliations:
Dept of Industrial Engineering, Inha University, Incheon-city, Korea;Division of e-business IT, Sungkyul University, Anyang-city, Kyunggi-Do, Korea
Venue:
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
Year:
2006

Citing 11
Cited 1

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
On near-uniform URL sampling

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Breadth-first crawling yields high-quality pages

Proceedings of the 10th 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
Who Links to Whom: Mining Linkage between Web Sites

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Ranking the web frontier

Proceedings of the 13th international conference on World Wide Web
Using the structure of Web sites for automatic segmentation of tables

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Combating web spam with trustrank

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Hierarchical web structuring from the web as a graph approach with repetitive cycle proof

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications

Query based optimal web site clustering using simulated annealing

Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on finding maximum rooted spanning trees (MRSTs) for structured web search including hop constraints We describe the meaning of structured web search and develop two binary integer linear programming models to find the best MRST New methods for measuring the relevance among web objects are devised and used for structured web search Some case studies are performed with real web sites and results are reported.