메뉴 건너뛰기




Volumn 3579, Issue , 2005, Pages 124-129

Identifying websites with flow simulation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; MARKOV PROCESSES; ONLINE SYSTEMS;

EID: 26444434232     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11531371_18     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 2
    • 0003780986 scopus 로고    scopus 로고
    • The pagerank citation ranking: Bringing order to the web
    • Stanford Digital Library Technologies Project
    • Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
    • (1998) Technical Report
    • Page, L.1    Brin, S.2    Motwani, R.3    Winograd, T.4
  • 3
    • 0024090156 scopus 로고
    • A new approach to the maximum-flow problem
    • Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of the ACM 35 (1988) 921-940
    • (1988) Journal of the ACM , vol.35 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 5
    • 26444442112 scopus 로고    scopus 로고
    • Identifying websites with flow simulation
    • Gemo, INRIA Futurs, Orsay, France
    • Senellart, P.: Identifying websites with flow simulation. Technical Report 387, Gemo, INRIA Futurs, Orsay, France (2005) ftp://ftp.inria.fr/INRIA/ Projects/gemo/gemo/GemoReport-387.ps.gz.
    • (2005) Technical Report , vol.387
    • Senellart, P.1
  • 7
    • 0002502515 scopus 로고    scopus 로고
    • Constructing, organizing, and visualizing collections of topically related Web resources
    • Terveen, L., Hill, W., Amento, B.: Constructing, organizing, and visualizing collections of topically related Web resources. ACM Transactions on Computer-Human Interaction 6 (1999) 67-94
    • (1999) ACM Transactions on Computer-human Interaction , vol.6 , pp. 67-94
    • Terveen, L.1    Hill, W.2    Amento, B.3
  • 9
    • 0001137959 scopus 로고
    • Determing the maximal flow in a network by the method of preflows
    • Karzanov, A.V.: Determing the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady 15 (1974) 434-437
    • (1974) Soviet Mathematics Doklady , vol.15 , pp. 434-437
    • Karzanov, A.V.1


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