scientific article
From MaRDI portal
Publication:3122905
DOI<5::AID-RSA2>3.0.CO;2-Z 10.1002/(SICI)1098-2418(199701/03)10:1/2<5::AID-RSA2>3.0.CO;2-ZzbMath0868.05048MaRDI QIDQ3122905
Colin J. H. McDiarmid, Alan M. Frieze
Publication date: 19 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyrandom graphsconnectivityparallel algorithmspathHamiltonian cyclestreesmatchingsgraph algorithmsstable setscoloringsaverage case analysis
Related Items
Coloring random graphs, Surprising identities for the greedy independent set on Cayley trees, On independent sets in random graphs, An improved algorithm for approximating the chromatic number of \(G_{n,p}\), Constructions of independent sets in random intersection graphs, On the longest path of a randomly weighted tournament, A Computing Procedure for Quantification Theory, A hard dial-a-ride problem that is easy on average, GHS algorithm on a graph with random weights, Distributed algorithms for random graphs, Finding paths in sparse random graphs requires many queries, Finding Hamilton cycles in random graphs with few queries, Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback, Finding a Hamilton cycle fast on average using rotations and extensions, Finding large cliques in sparse semi-random graphs by simple randomized search heuristics, On percolation and ‐hardness, Typical performance of approximation algorithms for NP-hard problems, Improved random graph isomorphism, The chromatic number of random intersection graphs, Critical random graphs and the structure of a minimum spanning tree, Gibbs rapidly samples colorings of \(G(n, d/n)\), Large Cliques in a Power-Law Random Graph, The condensation phase transition in random graph coloring, Approximately Counting Embeddings into Random Graphs, Geometry of the minimal spanning tree of a random 3-regular graph, Expected Maximum Block Size in Critical Random Graphs, Large independent sets in random regular graphs, On the Chromatic Index of Random Uniform Hypergraphs, Unnamed Item, On the typical case complexity of graph optimization, Heuristics for semirandom graph problems
