Advertisement
Published in:
2006 | OriginalPaper | Chapter
Maximum Rooted Spanning Trees for the Web
Authors : Wookey Lee, Seungkil Lim
Published in: On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.