„Random graph“

Suchergebnisse

1.427 Treffer

• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques – 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings
  Gupta, Anupam ; Jansen, Klaus ; Rolim, José D.P. ; Servedio, Rocco 2012 Springer Berlin Heidelberg
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques – 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings
  Goldberg, Leslie Ann ; Jansen, Klaus ; Ravi, Ramamoorthi ; Rolim, José D.P. 2011 Springer Berlin Heidelberg
• Approximation and Online Algorithms – 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers
  2011 Springer Berlin Heidelberg
• Algorithms for Sensor Systems – 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers
  Scheideler, Christian 2010 Springer Berlin Heidelberg
• Structural, Syntactic, and Statistical Pattern Recognition – Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004. Proceedings
  Fränti, Pasi ; Brown, Gavin ; Loog, Marco ; Escolano, Francisco ; Pelillo, Marcello 2004 Springer Berlin Heidelberg
• Approximation and Online Algorithms – 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers
  Jansen, Klaus ; Solis-Oba, Roberto 2010 Springer Berlin Heidelberg
• Convergence Rates in Dynamic Network Models
  Kück, Fabian ; Schuhmacher, Dominic ; Sturm, Anja 2018 Niedersächsische Staats- und Universitätsbibliothek Göttingen
• Dynamic averaging load balancing on arbitrary graphs
  Berenbrink, Petra ; Hintze, Lukas ; Hosseinpour, Hamed ; Kaaser, Dominik 2023 Technische Universität Hamburg. Universitätsbibliothek
• An experimental study of external memory algorithms for connected components
  Brodal, Gerth Stølting ; Fagerberg, Rolf ; Hammer, David ; Meyer, Ulrich ; Penschuck, Manuel ; Tran, Hung 2021 Universitätsbibliothek Johann Christian Senckenberg
• Hardness of FO Model-Checking on Random Graphs
  Dreier, Jan ; Rossmanith, Peter 2019 Universitätsbibliothek der RWTH Aachen
• Hard Problems on Random Graphs
  Dreier, Jan ; Lotze, Henri ; Rossmanith, Peter 2020 Universitätsbibliothek der RWTH Aachen
• First-Order Model-Checking in Random Graphs and Complex Networks
  Dreier, Jan ; Kuinke, Philipp ; Rossmanith, Peter 2020 Universitätsbibliothek der RWTH Aachen
• Ancestral Recombination Graphs under Non-Random Ascertainment, with Applications to Gene Mapping
  Hössjer, Ola ; Hartman, Linda ; Humphreys, Keith
• The Beta-Binomial SGoF method for multiple dependent tests
  de Uña-Alvarez, Jacobo
• The modulus of continuity of Wegner estimates for random Schrödinger operators on metric graphs
  Gruber, Michael Johannes ; Veselić, Ivan
• Single-Image Insect Pose Estimation by Graph Based Geometric Models and Random Forests
  Shen, Minmin ; Duan, Le ; Deussen, Oliver 2016 Bibliothek der Universität Konstanz
• Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory
  Penschuck, Manuel 2017 Universitätsbibliothek Johann Christian Senckenberg
• Lifshitz tails for a percolation model in the continuum
  Kirsch, Werner ; Najar, Hatem
• The condensation phase transition in random graph coloring
  Bapst, Victor ; Coja-Oghlan, Amin ; Hetterich, Samuel ; Raßmann, Felicia ; Vilenchik, Dan 2017 Universitätsbibliothek Johann Christian Senckenberg
• Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
  Brandes, Ulrik ; Lerner, Jürgen 2009 Bibliothek der Universität Konstanz