The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603) (← links)
- The cover time of sparse random graphs (Q3419608) (← links)
- Randomly generated intersecting hypergraphs II (Q3419609) (← links)
- First-Order Definability of Trees and Sparse Random Graphs (Q3438138) (← links)
- (Q3447279) (← links)
- Rainbow Connection of Random Regular Graphs (Q3452164) (← links)
- Greedy Matching on the Line (Q3474883) (← links)
- On the number of hamilton cycles in a random graph (Q3487391) (← links)
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456) (← links)
- (Q3499508) (← links)
- The cover time of the giant component of a random graph (Q3514698) (← links)
- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (Q3521916) (← links)
- Line-of-Sight Networks (Q3557508) (← links)
- Memoryless Rules for Achlioptas Processes (Q3563955) (← links)
- Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (Q3578203) (← links)
- Crawling on web graphs (Q3579239) (← links)
- On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (Q3581403) (← links)
- The Cover Time of Random Digraphs (Q3603483) (← links)
- Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439 (Q3619616) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q3622691) (← links)
- Hamilton Cycles in Random Lifts of Directed Graphs (Q3629460) (← links)
- Multiple Random Walks and Interacting Particle Systems (Q3638109) (← links)
- Average-Case Analyses of Vickrey Costs (Q3638896) (← links)
- (Q3683849) (← links)
- (Q3691698) (← links)
- (Q3720644) (← links)
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem (Q3722413) (← links)
- On linear programs with random costs (Q3724096) (← links)
- Planar 3DM is NP-complete (Q3745303) (← links)
- Expected Behaviour of Line-Balancing Heuristics (Q3757670) (← links)
- An algorithm for finding hamilton cycles in random directed graphs (Q3790664) (← links)
- (Q3794221) (← links)
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences (Q3800123) (← links)
- On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients (Q3801370) (← links)
- (Q3816114) (← links)
- On the Complexity of Computing the Volume of a Polyhedron (Q3821581) (← links)
- Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316) (← links)
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice (Q3916373) (← links)
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (Q3936521) (← links)
- Algebraic Linear Programming (Q3965927) (← links)
- Randomized greedy matching (Q3970901) (← links)
- Spanning maximal planar subgraphs of random graphs (Q3974713) (← links)
- Pancyclic random graphs (Q3975002) (← links)
- Parallel colouring of random graphs (Q3975003) (← links)
- Hamiltonian cycles in a class of random graphs: One step further (Q3975004) (← links)
- Computing the volume of convex bodies: A case where randomness provably helps (Q3976408) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- (Q4014322) (← links)
- Counting the Number of Hamilton Cycles in Random Digraphs (Q4014635) (← links)
- A cost function property for plant location problems (Q4044368) (← links)
