„Random graph“

Suchergebnisse

1.427 Treffer

• Random Ramsey graphs for the four-cycle
  Füredi, Zoltán 1990 Sonderforschungsbereich 343
• Random graphs
  Karoński, Michał 1990 Sonderforschungsbereich 343
• Peer-to-peer networks based on random graphs
  Mahlmann, Peter
• Martingales, isoperimetric inequalities and random graphs
  Bollobás, Béla 1988 Forschungsinst. für Diskrete Mathematik
• Traversals of Infinite Graphs with Random Local Orientations
  White, David 2015 LAP LAMBERT Academic Publishing
• Random Graphs and Cuckoo Hashing – A precise average case analysis of Cuckoo Hashing and some parameters of sparse random graphs
  Kutzelnigg, Reinhard 2009 Suedwestdeutscher Verlag fuer Hochschulschriften
• Unimodular lattice triangulations as small-world and scale-free random graphs
  Krüger, Benedikt ; Schmidt, E. M. ; Mecke, Klaus R. 2015 Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
• A generator for dynamic clustered random graphs
  Görke, Robert ; Staudt, Christian 2009 Univ., Fak. für Informatik
• Geometry, Structure and Randomness in Combinatorics
  2014 Scuola Normale Superiore
• Random procedures for dominating sets in graphs
  Artmann, Sarah 2008 Techn. Univ., Fak. für Mathematik
• The component structure of random graphs – phase transitions in random graphs and random graph processes
  Seierstad, Taral Guldahl 2008 VDM Verlag Dr. Müller
• Constrained random graph processes
  Schlatter, Dirk
• The phase transition in random graphs and random graph processes
  Seierstad, Taral Guldahl
• Random planar structures and random graph processes
  Kang, Mihyun
• Extremal problems in random graphs – Ramsey and Turán type results
  Marciniszyn, Martin 2007 VDM Verlag Dr. Müller
• Algorithms - ESA 2014 – 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
  2014 Springer Berlin Heidelberg
• Finding large cliques in sparse semi random graphs by simple randomized search heuristics
  Storch, Tobias 2006 Sekretariat des SFB 531
• Algorithms – 22nd Annual European symposium ; proceedings
  Schulz, Andreas S. ; Wagner, Dorothea 2014 Springer
• How randomized search heuristics find maximum cliques in planar graphs
  Storch, Tobias 2006 Sekretariat des SFB 531
• Photogrammetric DSM denoising
  Nex, F. ; Gerke, M.