注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

gcalda's graphs [15 articles]

当前文献位于 gcalda's 文献库 标签分类为 graphs. You can also see everyone's graphs.
  • A faster algorithm for betweenness centrality
    (2001)
    by U Brandes
    posted to graphs scale-free-networks by gcalda on 2007-05-03 15:27:45 as read along with 10 people and 3 groups schaal shivaram maqbes nojhan tokushiman jaspervoskuilen grahamc andreacapocci jmarcelino salvoscellato EvolutionaryComputation Metaheuristics Optimization
  • Detection of topological patterns in complex networks: correlation profile of the internet
    Physica A: Statistical and Theoretical Physics, Vol. 333 (15 February 2004), pp. 529-540.
    by Sergei Maslov, Kim Sneppen, Alexei Zaliznyak
    posted to graphs scale-free-networks by gcalda on 2007-04-26 14:20:46 as read along with 2 people cjeans phoenixzxl
  • Partitioning Sparse Matrices with Eigenvectors of Graphs
    SIAM Journal on Matrix Analysis and Applications, Vol. 11, No. 3. (1990), pp. 430-452.
    by Alex Pothen, Horst D Simon, Kang P Liou
    posted to graphs book by gcalda on 2007-01-18 11:19:44 as **
  • The Diameter of Sparse Random Graphs
    Advances in Applied Mathematics, Vol. 26, No. 4. (May 2001), pp. 257-279.
    by Fan Chung, Linyuan Lu
    posted to book graphs by gcalda on 2007-01-04 14:29:29 as ** along with 1 person ransombriggs
  • Introduction to Graph Theory (2^nd Edition)
    (2001)
    by DB West
    posted to book graphs by gcalda on 2006-12-22 10:30:51 as **
  • Partitioning Networks by Eigenvectors
    Proceedings of the International Conference on Social Networks, Vol. 1: Methodology (1995), pp. 47-58.
    by AJ Seary, WD Richards
    posted to graphs book by gcalda on 2006-12-22 10:30:50 as **
  • On the strength of connectedness of a random graph
    Acta Mathematica Hungarica, Vol. 12 (1961), pp. 261-267.
    by P Erdős, A Rényi
    posted to book graphs by gcalda on 2006-12-22 10:30:48 as **
  • On the evolution of random graphs
    Publications of the Mathematical Institute of the Hungarian Academy of Sciences, Vol. 5 (1960), pp. 17-61.
    by P Erdős, A Rényi
    posted to book graphs by gcalda on 2006-12-22 10:30:48 as **
  • On random graphs
    Publicationes Mathematicae Debrecen, Vol. 6 (1959), pp. 290-297.
    by P Erdős, A Rényi
    posted to book graphs by gcalda on 2006-12-22 10:30:48 as **
  • Famous Trails to Paul Erdős
    The Mathematical Intelligencer, Vol. 21 (1999), pp. 51-63.
    by R De Castro, JW Grossman
    posted to book graphs small-world by gcalda on 2006-12-22 10:30:47 as **
  • The diameter of a scale-free random graph
    Combinatorica, Vol. 24 (2004), pp. 5-34.
    by B Bollobás, O Riordan
    posted to book graphs by gcalda on 2006-12-22 10:30:46 as **
  • Random Graphs
    (1985)
    by B Bollobás
    posted to book graphs by gcalda on 2006-12-22 10:30:46 as **
  • Graph Theory, An Introductory course
    (1979)
    by B Bollobás
    posted to book graphs by gcalda on 2006-12-22 10:30:46 as **
  • A Faster Algorithm for Betweenness Centrality
    Journal of Mathematical Sociology, Vol. 25 (2001), pp. 163-177.
    by U Brandes
    posted to graphs book by gcalda on 2006-12-22 10:30:46 as **
  • A Random Graph Model for Massive Graphs
    (2000), pp. 171-180.
    by W Aiello, F Chung, L Lu
    posted to book graphs by gcalda on 2006-12-22 10:30:45 as **
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/gcalda/tag/graphs

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.