The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- A note on the vacant set of random walks on the hypercube and other regular graphs of high degree (Q266695) (← links)
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity (Q345119) (← links)
- On a sparse random graph with minimum degree three: likely Pósa sets are large (Q376545) (← links)
- The cover times of random walks on random uniform hypergraphs (Q392193) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- The topology of competitively constructed graphs (Q405221) (← links)
- Stationary distribution and cover time of random walks on random digraphs (Q412164) (← links)
- Rainbow Hamilton cycles in uniform hypergraphs (Q426813) (← links)
- Cover time of a random graph with given degree sequence (Q456654) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Looking for vertex number one (Q525308) (← links)
- Loose Hamilton cycles in random uniform hypergraphs (Q540025) (← links)
- A note on the random greedy triangle-packing algorithm (Q547873) (← links)
- (Q583109) (redirect page) (← links)
- On an optimization problem with nested constraints (Q583110) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- Polychromatic Hamilton cycles (Q685588) (← links)
- The average performance of the greedy matching algorithm (Q687707) (← links)
- Clustering large graphs via the singular value decomposition (Q703073) (← links)
- The \(t\)-tone chromatic number of random graphs (Q742618) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- The cover time of the preferential attachment graph (Q864904) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Random graph orders (Q911622) (← links)
- The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected (Q914707) (← links)
- Survival time of a random graph (Q918994) (← links)
- On random minimum length spanning trees (Q923108) (← links)
- On the independence number of random graphs (Q923109) (← links)
- On two Hamilton cycle problems in random graphs (Q948883) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- Loose Hamilton cycles in random 3-uniform hypergraphs (Q976682) (← links)
- Logconcave random graphs (Q986716) (← links)
- Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\) (Q1010652) (← links)
- On rainbow trees and cycles (Q1010778) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- On the connectivity of random m-orientable graphs and digraphs (Q1056764) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- Hamiltonian cycles in random regular graphs (Q1063002) (← links)
- On the value of a random minimum spanning tree problem (Q1066149) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs (Q1075342) (← links)
- Finding Hamilton cycles in sparse random graphs (Q1080865) (← links)
- A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
