메뉴 건너뛰기




Volumn , Issue 6, 2006, Pages

On the number of circuits in random graphs

Author keywords

Cavity and replica method; Message passing algorithms; Networks; Random graphs

Indexed keywords


EID: 34548864943     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2006/06/P06019     Document Type: Article
Times cited : (41)

References (64)
  • 3
    • 0000537111 scopus 로고    scopus 로고
    • Models of random regular graphs
    • Wormald N C 1999 Models of random regular graphs Surveys in Combinatorics (London Mathematical Society Lecture Note Series vol 276) ed J D Lamb and D A Preece (Cambridge: Cambridge University Press) p239
    • (1999) Surveys in Combinatorics , pp. 239
    • Wormald, N.C.1
  • 26
    • 33745947550 scopus 로고    scopus 로고
    • http://www.netdimes.org/
  • 62
    • 33745936510 scopus 로고    scopus 로고
    • Riordan O 2005 Preprint math.CO/0511093
    • (2005)
    • Riordan, O.1
  • 63
    • 0003101125 scopus 로고    scopus 로고
    • The differential equation method for random graph processes and greedy algorithms
    • Wormald N C 1999 The differential equation method for random graph processes and greedy algorithms Lectures on Approximation and Randomized Algorithms ed M Karonski and H J Proemel (Warsaw: PWN) p73
    • (1999) Lectures on Approximation and Randomized Algorithms , pp. 73
    • Wormald, N.C.1


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