The cook-book approach to the differential equation method
type: Item
instance of: scholarly article
title: The cook-book approach to the differential equation method
zbMATH Open document ID: 1302.05168
author: D. Mitsche
author: J. Díaz
published in: Computer Science Review
publication date: 2014-10-24T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05D40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 05-02
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 6360982
zbMATH Keywords: differential equation method
zbMATH Keywords: random regular graphs
zbMATH Keywords: random Boolean formulae
zbMATH Keywords: balls and bins
Wikidata QID: Q115358379
MaRDI profile type: Publication
full work available at URL: j.cosrev.2010.04.002
OpenAlex ID: W2011146667
cites work: Q4263664
cites work: Concentration of Measure for the Analysis of Randomized Algorithms
cites work: Q3503433
cites work: Probability and Computing
cites work: Q4856179
cites work: Q4519896
cites work: Q3496342
cites work: Q4226453
cites work: A guided tour of Chernoff bounds
cites work: Q4788607
cites work: Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
cites work: Advanced Lectures on Machine Learning
cites work: Solutions of ordinary differential equations as limits of pure jump markov processes
cites work: Large deviations
cites work: Q3917278
cites work: On the existence of a factor of degree one of a connected random graph
cites work: Q4938890
cites work: Small maximal matchings in random graphs.
cites work: Lower bounds for random 3-SAT via differential equations
cites work: Q4788604
cites work: Probability and random processes.
cites work: Q3241303
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Weighted sums of certain dependent random variables
cites work: Differential equations for random processes and random graphs
cites work: Analysis of greedy algorithms on graphs with bounded degrees
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: Random graphs.
cites work: Uniform generation of random regular graphs of moderate degree
cites work: Generating Random Regular Graphs Quickly
cites work: Q4198056
cites work: On the independence and chromatic numbers of random regular graphs
cites work: On the independence number of random cubic graphs
cites work: Q3786498
cites work: Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
cites work: The isoperimetric number of random regular graphs
cites work: Q4027167
cites work: Q2766666
cites work: Bounds on the max and min bisection of random cubic and random 4-regular graphs
cites work: Bounds on the bisection width for random \(d\)-regular graphs
cites work: Large independent sets in random regular graphs
cites work: On the Independent Domination Number of Random Regular Graphs
cites work: NP-completeness of some generalizations of the maximum matching problem
cites work: Minimum independent dominating sets of random cubic graphs
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: Q4228436
cites work: A threshold for unsatisfiability
cites work: Random 2-SAT: Results and problems
cites work: Random Formulas Have Frozen Variables
cites work: Q3140436
cites work: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
cites work: Analysis of Two Simple Heuristics on a Random Instance ofk-sat
cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

The cook-book approach to the differential equation method (cites work)
cites work: The probabilistic analysis of a greedy satisfiability algorithm

The cook-book approach to the differential equation method (cites work)
cites work: Approximating the unsatisfiability threshold of random formulas

The cook-book approach to the differential equation method (cites work)
cites work: On the satisfiability threshold of formulas with three literals per clause

The cook-book approach to the differential equation method (cites work)
cites work: On the satisfiability threshold and clustering of solutions of random 3-SAT formulas

The cook-book approach to the differential equation method (cites work)
cites work: The first cycles in an evolving graph

The cook-book approach to the differential equation method (cites work)
cites work: Sudden emergence of a giant \(k\)-core in a random graph

The cook-book approach to the differential equation method (cites work)
cites work: Encores on cores

The cook-book approach to the differential equation method (cites work)
cites work: A simple solution to the k‐core problem

The cook-book approach to the differential equation method (cites work)
cites work: Thek-Core and Branching Processes

The cook-book approach to the differential equation method (cites work)
cites work: Size and connectivity of the \(k\)-core of a random graph

The cook-book approach to the differential equation method (cites work)
cites work: Almost all graphs with average degree 4 are 3-colorable

The cook-book approach to the differential equation method (cites work)
cites work: New methods to color the vertices of a graph

The cook-book approach to the differential equation method (cites work)
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

The cook-book approach to the differential equation method (cites work)
cites work: Colouring Random 4-Regular Graphs

The cook-book approach to the differential equation method (cites work)
cites work: On the chromatic number of a random 5-regular graph

The cook-book approach to the differential equation method (cites work)
cites work: The acyclic edge chromatic number of a random d‐regular graph is d + 1

The cook-book approach to the differential equation method (cites work)
cites work: Acyclic edge colorings of graphs

The cook-book approach to the differential equation method (DOI)
DOI: 10.1016/J.COSREV.2010.04.002