메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1967-1970

Graph-based seed selection for web-scale crawlers

Author keywords

Crawler; Graph analysis; PageRank; Seed selection

Indexed keywords

GRAPH ANALYSIS; GRAPH-BASED; PAGERANK; SEED SELECTION; WEB CRAWLING; WEB DATA;

EID: 74549193422     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646277     Document Type: Conference Paper
Times cited : (14)

References (3)
  • 2
    • 0032164214 scopus 로고    scopus 로고
    • Analysis of the Greedy Approach in Problems of Maximum k-Coverage
    • D. Hochbaum and A. Pathria. Analysis of the Greedy Approach in Problems of Maximum k-Coverage. Naval Research Logistics, 45(6):615-627, 1998.
    • (1998) Naval Research Logistics , vol.45 , Issue.6 , pp. 615-627
    • Hochbaum, D.1    Pathria, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.