The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- On key storage in secure networks (Q1903344) (← links)
- Covering the edges of a random graph by cliques (Q1906846) (← links)
- Probabilistic analysis of an algorithm in the theory of markets in indivisible goods (Q1909402) (← links)
- Randomly coloring simple hypergraphs (Q1944148) (← links)
- Separating populations with wide data: a spectral analysis (Q1951968) (← links)
- Rainbow connection of sparse random graphs (Q1953307) (← links)
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs (Q1953356) (← links)
- A note on sparse random graphs and cover graphs (Q1972677) (← links)
- min-wise independent linear permutations (Q1977373) (← links)
- A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
- On random multi-dimensional assignment problems (Q2004066) (← links)
- Shortest paths with a cost constraint: a probabilistic analysis (Q2043355) (← links)
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (Q2060557) (← links)
- Spanners in randomly weighted graphs: independent edge lengths (Q2065765) (← links)
- Localization game for random graphs (Q2065786) (← links)
- Degree distribution for duplication-divergence graphs: large deviations (Q2110621) (← links)
- A note on spanning \(K_r\)-cycles in random graphs (Q2129852) (← links)
- On the existence of Hamilton cycles with a periodic pattern in a random digraph (Q2213806) (← links)
- Minimum-weight combinatorial structures under random cost-constraints (Q2223474) (← links)
- A randomly weighted minimum spanning tree with a random cost constraint (Q2223477) (← links)
- Isomorphism for random \(k\)-uniform hypergraphs (Q2224850) (← links)
- The game chromatic number of a random hypergraph (Q2232032) (← links)
- A note on randomly colored matchings in random bipartite graphs (Q2232034) (← links)
- Power of \(k\) choices and rainbow spanning trees in random graphs (Q2256126) (← links)
- Occupancy problems and random algebras (Q2276987) (← links)
- A note on log-concave random graphs (Q2323813) (← links)
- On the rank of a random binary matrix (Q2327226) (← links)
- Random triangle removal (Q2346047) (← links)
- On the chromatic number of a random hypergraph (Q2347844) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\) (Q2387184) (← links)
- Approximate counting of regular hypergraphs (Q2445249) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- Random 2-SAT with prescribed literal degrees (Q2642316) (← links)
- Multitrees in random graphs (Q2684902) (← links)
- The concentration of the maximum degree in the duplication-divergence models (Q2695307) (← links)
- Edge-disjoint paths in expander graphs (Q2706135) (← links)
- On Markov chains for randomly \(H\)-coloring a graph (Q2731604) (← links)
- Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids (Q2737882) (← links)
- Avoiding a giant component (Q2748427) (← links)
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems. (Q2768360) (← links)
- \(G\)-intersecting families (Q2777889) (← links)
- Rainbow matchings and Hamilton cycles in random graphs (Q2811161) (← links)
- Rainbow arborescence in random digraphs (Q2833120) (← links)
- On the game chromatic number of sparse random graphs (Q2848537) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- Some Typical Properties of the Spatial Preferred Attachment Model (Q2900582) (← links)
- On Certain Properties of Random Apollonian Networks (Q2900588) (← links)
