The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- On the connectivity of proper colorings of random graphs and hypergraphs (Q5128749) (← links)
- A randomly weighted minimum spanning tree with a random cost constraint (Q5146809) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- Analyzing Walksat on Random Formulas (Q5194708) (← links)
- The cover time of a biased random walk on <i>G<sub>n,p</sub></i> (Q5195115) (← links)
- (Q5202206) (← links)
- Near-perfect token distribution (Q5204326) (← links)
- Random Graphs with a Fixed Maximum Degree (Q5208644) (← links)
- Minors of a random binary matroid (Q5216181) (← links)
- On the insertion time of random walk cuckoo hashing (Q5229339) (← links)
- A Random Variant of the Game of Plates and Olives (Q5232149) (← links)
- On the Cover Time of Dense Graphs (Q5232158) (← links)
- On the rank of a random binary matrix (Q5236242) (← links)
- Notes on growing a tree in a graph (Q5242878) (← links)
- Maker‐breaker games on random geometric graphs (Q5256385) (← links)
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (Q5256387) (← links)
- The height of random <i>k</i>‐trees and related branching processes (Q5256388) (← links)
- Product rule wins a competitive game (Q5295085) (← links)
- Adversarial Deletion in a Scale-Free Random Graph Process (Q5295413) (← links)
- The diameter of randomly perturbed digraphs and some applications (Q5297137) (← links)
- (Q5302103) (← links)
- Algorithms and Models for the Web-Graph (Q5311173) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313038) (← links)
- The Cover Time of Random Regular Graphs (Q5317583) (← links)
- Separating subadditive euclidean functionals (Q5361816) (← links)
- Loose Hamilton Cycles in Regular Hypergraphs (Q5364219) (← links)
- On the Length of a Random Minimum Spanning Tree (Q5364266) (← links)
- (Q5365090) (← links)
- (Q5365111) (← links)
- Separating subadditive euclidean functionals (Q5371140) (← links)
- (Q5371198) (← links)
- The Influence of Search Engines on Preferential Attachment (Q5384926) (← links)
- (Q5387670) (← links)
- Separating Populations with Wide Data: A Spectral Analysis (Q5387777) (← links)
- Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (Q5392910) (← links)
- On the Non-Planarity of a Random Subgraph (Q5397728) (← links)
- Rainbow hamilton cycles in random graphs (Q5415595) (← links)
- (Q5420010) (← links)
- The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems (Q5422494) (← links)
- Fast monte-carlo algorithms for finding low-rank approximations (Q5435673) (← links)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem (Q5443801) (← links)
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence (Q5443802) (← links)
- The game chromatic number of random graphs (Q5454360) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q5458299) (← links)
- The Strong Chromatic Index of Random Graphs (Q5470789) (← links)
- The satisfiability threshold for randomly generated binary constraint satisfaction problems (Q5471050) (← links)
- Almost universal graphs (Q5486325) (← links)
- Expanders via Random Spanning Trees (Q5494927) (← links)
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph (Q5700145) (← links)
- On Random Symmetric Travelling Salesman Problems (Q5704203) (← links)
