The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- Packing Hamilton cycles in random and pseudo-random hypergraphs (Q2909240) (← links)
- Packing tight Hamilton cycles in uniform hypergraphs (Q2910924) (← links)
- Adversarial deletion in a scale free random graph process (Q2921681) (← links)
- The influence of search engines on preferential attachment (Q2921682) (← links)
- On the random 2-stage minimum spanning tree (Q2921759) (← links)
- The cover time of two classes of random graphs (Q2921765) (← links)
- Analyzing Walksat on random formulas (Q2929704) (← links)
- On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three (Q2930057) (← links)
- (Q2934689) (← links)
- Walker-Breaker Games (Q2944455) (← links)
- Introduction to Random Graphs (Q2949990) (← links)
- (Q2959892) (← links)
- Minimum Cost Matching in a Random Graph with Random Costs (Q2968521) (← links)
- On random<i>k</i>-out subgraphs of large graphs (Q2977562) (← links)
- The cover time of random geometric graphs (Q2998891) (← links)
- Flips in Graphs (Q3008026) (← links)
- Random Walks with Look-Ahead in Scale-Free Random Graphs (Q3008035) (← links)
- The solution of some random NP-hard problems in polynomial expected time (Q3031922) (← links)
- Hamilton cycles in 3-out (Q3055783) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- Multiple Random Walks in Random Regular Graphs (Q3058528) (← links)
- An Efficient Sparse Regularity Concept (Q3058542) (← links)
- Ramsey games with giants (Q3068759) (← links)
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence (Q3103622) (← links)
- Pattern Colored Hamilton Cycles in Random Graphs (Q3122311) (← links)
- Algorithmic theory of random graphs (Q3122905) (← links)
- Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph (Q3123118) (← links)
- (Q3128893) (← links)
- (Q3128923) (← links)
- (Q3140436) (← links)
- (Q3140438) (← links)
- Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number (Q3146985) (← links)
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity (Q3147237) (← links)
- Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs (Q3147274) (← links)
- On Counting Independent Sets in Sparse Graphs (Q3149880) (← links)
- (Q3154668) (← links)
- A new approach to the planted clique problem (Q3165958) (← links)
- Rainbow Connectivity of Sparse Random Graphs (Q3167424) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables (Q3168498) (← links)
- Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (Q3174699) (← links)
- Packing Hamilton Cycles Online (Q3177359) (← links)
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three (Q3192373) (← links)
- (Q3222861) (← links)
- How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? (Q3299214) (← links)
- (Q3355235) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- On the random 2-stage minimum spanning tree (Q3376662) (← links)
- Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis (Q3386518) (← links)
