메뉴 건너뛰기




Volumn , Issue , 2009, Pages 13-18

Classifying network complexity

Author keywords

Internet complexity; Network complexity; Robustness; Simplicity

Indexed keywords

AS GRAPH; CONTROL NETWORK; NETWORK COMPLEXITY; POSITION PAPERS; REAL-LIFE NETWORKS; SPECIFIC AREAS;

EID: 76749161460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1658978.1658983     Document Type: Conference Paper
Times cited : (4)

References (17)
  • 1
    • 0040455592 scopus 로고
    • Algebraic graph theory
    • Cambridge University Press, London
    • N. Biggs, "Algebraic graph theory", Cambridge University Press, London, 1974, Cambridge Tracts in Mathematics, No. 67.
    • (1974) Cambridge Tracts in Mathematics , vol.67
    • Biggs, N.1
  • 5
    • 17844367220 scopus 로고
    • Graph complexity and the Laplacian matrix in blocked experiments
    • G. Constantine, "Graph complexity and the Laplacian matrix in blocked experiments", Linear and Multilinear Algebra 28 (1990), no. 1-2, 49-56.
    • (1990) Linear and Multilinear Algebra , vol.28 , Issue.1-2 , pp. 49-56
    • Constantine, G.1
  • 7
    • 38249027322 scopus 로고
    • A bound for the complexity of a simple graph
    • R. Grone and R. Merris, "A bound for the complexity of a simple graph", Discrete Math. 69 (1988), no. 1, 97-99.
    • (1988) Discrete Math , vol.69 , Issue.1 , pp. 97-99
    • Grone, R.1    Merris, R.2
  • 8
    • 3643058800 scopus 로고    scopus 로고
    • Modelling communication networks, present and future
    • F. P. Kelly:"Modelling communication networks, present and future"; Phil. Trans. Roy. Soc. Lond. A354 (1996) 437-463
    • (1996) Phil. Trans. Roy. Soc. Lond , vol.A354 , pp. 437-463
    • Kelly, F.P.1
  • 11
    • 76749131057 scopus 로고    scopus 로고
    • The Linear Complexity of a Graph; David L. Neel, Michael E. Orrison; 2006; The electronic journal of combinatorics
    • "The Linear Complexity of a Graph"; David L. Neel, Michael E. Orrison; 2006; The electronic journal of combinatorics
  • 12
    • 76749120422 scopus 로고    scopus 로고
    • Modeling the Routing of an ISP with C-BGP
    • B. Quoitin: "Modeling the Routing of an ISP with C-BGP"; NANOG 40 meetings archive; 2007
    • (2007) NANOG 40 meetings archive
    • Quoitin, B.1
  • 16
    • 31744435604 scopus 로고    scopus 로고
    • Using Dependency Models to Manage Complex Software Architecture
    • Also
    • N. Sangal et al: "Using Dependency Models to Manage Complex Software Architecture"; Proceedings OOPSLA 2005. Also: http://www.eclipsezone.com/ articles/lattix-dsm/
    • (2005) Proceedings OOPSLA
    • Sangal, N.1
  • 17
    • 76749168933 scopus 로고    scopus 로고
    • J. Strassner: Directory Enabled Networks; ISBN 1578701406; 1999
    • J. Strassner: "Directory Enabled Networks"; ISBN 1578701406; 1999


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