Wiley‐Interscience Series in Discrete Mathematics and Optimization

By W. Kaplan. 2011

336 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Novel scaling limits for critical inhomogeneous random graphs (2009, neutral): “, the monographs [2, 5, 10, 19, 29] and the references therein).”
Random Graphs and Complex Networks (2016, methodology): “We refer to the books [13, 50, 153] for more detailed references of the early literature on random graphs.”
Random walks on the random graph (2015, background): “an expander and by Cheeger’s inequality the spectral gap of the SRW on G, denoted gap, is uniformly bounded away from 0 (see [1] on expanders and, e.”
Solution of the minimum modulus problem for covering systems (2013, background): “We emphasize that the proof is the standard one, see for instance [1] pp.”
The Benders decomposition algorithm: A literature review (2017, background): “In any optimal solution to the MP, the number of active constraints never exceeds the number of decision variables (Minoux, 1986).”