The following pages link to Alan M. Frieze (Q1577015):
Displaying 50 items.
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Random graph orders (Q911622) (← links)
- The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected (Q914707) (← links)
- On the independence number of random graphs (Q923109) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- On the value of a random minimum spanning tree problem (Q1066149) (← links)
- Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039) (← links)
- Large holes in sparse random graphs (Q1113926) (← links)
- Quick approximation to matrices and applications (Q1125616) (← links)
- An algorithm for algebraic assignment problems (Q1138479) (← links)
- Probabilistic analysis of some Euclidean clustering problems (Q1147633) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- Hamilton cycles in a class of random directed graphs (Q1333332) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- A note on the localization number of random graphs: diameter two case (Q1720315) (← links)
- An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
- On the existence of Hamiltonian cycles in a class of random graphs (Q1838982) (← links)
- Hamilton cycles in random subgraphs of pseudo-random graphs (Q1849919) (← links)
- Covering the edges of a random graph by cliques (Q1906846) (← links)
- Occupancy problems and random algebras (Q2276987) (← links)
- Approximate counting of regular hypergraphs (Q2445249) (← links)
- Rainbow matchings and Hamilton cycles in random graphs (Q2811161) (← links)
- Rainbow Arborescence in Random Digraphs (Q2833120) (← links)
- Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005) (← 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)
- An Efficient Sparse Regularity Concept (Q3058542) (← links)
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence (Q3103622) (← links)
- On Counting Independent Sets in Sparse Graphs (Q3149880) (← links)
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables (Q3168498) (← links)
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three (Q3192373) (← links)
- 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)
- The cover time of the giant component of a random graph (Q3514698) (← links)
- Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (Q3578203) (← links)
- An algorithm for finding hamilton cycles in random directed graphs (Q3790664) (← links)
- On the Complexity of Computing the Volume of a Polyhedron (Q3821581) (← links)
- Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- Counting the Number of Hamilton Cycles in Random Digraphs (Q4014635) (← links)
- A cost function property for plant location problems (Q4044368) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Finding hidden hamiltonian cycles (Q4306372) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
- The emergence of a giant component in random subgraphs of pseudo-random graphs (Q4446876) (← links)
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (Q4819245) (← links)
- Efficient communication in an ad-hoc network (Q4828561) (← links)
