메뉴 건너뛰기




Volumn 4, Issue 1, 2007, Pages 1-16

Growing protean graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 70350572700     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2007.10129135     Document Type: Article
Times cited : (15)

References (10)
  • 2
    • 84924119652 scopus 로고    scopus 로고
    • A Survey of Web Graph Models
    • Banff, Alberta, Canada, August 5–7, 2004, Revised Selected Papers, edited by A. López-Ortiz and A. Hamel, Lecture Notes in Computer Science 3405. Berlin: Springer
    • A. Bonato. “A Survey of Web Graph Models.” In Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5–7, 2004, Revised Selected Papers, edited by A. López-Ortiz and A. Hamel, pp. 159–172, Lecture Notes in Computer Science 3405. Berlin: Springer, 2005.
    • (2005) Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004 , pp. 159-172
    • Bonato, A.1
  • 4
    • 84906243778 scopus 로고    scopus 로고
    • Coupling Online and Offline Analyses for Random Power Law Graphs
    • F. Chung and L. Lu. “Coupling Online and Offline Analyses for Random Power Law Graphs.” Internet Mathematics 1:4 (2004), 409–461.
    • (2004) Internet Mathematics , vol.1 , Issue.4 , pp. 409-461
    • Chung, F.1    Lu, L.2
  • 8
    • 84924164970 scopus 로고    scopus 로고
    • Protean Graphs—Giant Component and its Diameter
    • P. Prałat. “Protean Graphs—Giant Component and its Diameter.” Submitted to Discrete Mathematicae, 2006.
    • (2006) Discrete Mathematicae
    • Prałat, P.1
  • 9
    • 0003101125 scopus 로고    scopus 로고
    • The Differential Equation Method for Random Graph Processes and Greedy Algorithms
    • edited byM. Karoński and H. J. Prömel, Warsaw: PWN
    • N. Wormald. “The Differential Equation Method for Random Graph Processes and Greedy Algorithms.” In Lectures on Approximation and Randomized Algorithms, edited byM. Karoński and H. J. Prömel, pp. 73–155. Warsaw: PWN, 1999.
    • (1999) Lectures on Approximation and Randomized Algorithms , pp. 73-155
    • Wormald, N.1
  • 10
    • 84924118078 scopus 로고    scopus 로고
    • Section 8.2 in Handbook of Graph Theory, edited by J. L. Gross and J. Yellen, Boca Raton: CRC
    • N. C. Wormald. “Random Graphs and Asymptotics.” Section 8.2 in Handbook of Graph Theory, edited by J. L. Gross and J. Yellen, pp. 817–836. Boca Raton: CRC, 2004.
    • (2004) Random Graphs and Asymptotics , pp. 817-836
    • Wormald, N.C.1


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