The following pages link to Alan Frieze (Q1577015):
Displaying 50 items.
- The shortest-path problem for graphs with random arc-lengths (Q1086251) (← links)
- On large matchings and cycles in sparse random graphs (Q1092926) (← links)
- Maximum matchings in a class of random graphs (Q1093654) (← links)
- An algorithm for finding Hamilton paths and cycles in random graphs (Q1099190) (← links)
- Partitioning random graphs into large cycles (Q1104340) (← links)
- Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039) (← links)
- On the random construction of heaps (Q1108784) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- Large holes in sparse random graphs (Q1113926) (← links)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← 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 quadratic assignment problem (Q1173009) (← links)
- On the length of the longest monotone subsequence in a random permutation (Q1176972) (← links)
- On the independence and chromatic numbers of random regular graphs (Q1186131) (← links)
- Probabilistic analysis of the generalised assignment problem (Q1196166) (← links)
- A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
- Average-case analysis of the merging algorithm of Hwang and Lin (Q1277377) (← links)
- A simple algorithm for constructing Szemerédi's regularity partition (Q1283876) (← links)
- Random minimum length spanning trees in regular graphs (Q1288911) (← links)
- Log-Sobolev inequalities and sampling from log-concave distributions (Q1296584) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- Hamilton cycles in a class of random directed graphs (Q1333332) (← links)
- Sampling from log-concave distributions (Q1336592) (← links)
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458) (← links)
- On randomly generated intersecting hypergraphs (Q1408534) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- A note on random minimum length spanning trees (Q1578476) (← links)
- On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs (Q1587507) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Diffusion limited aggregation on the Boolean lattice (Q1634178) (← links)
- On rainbow Hamilton cycles in random hypergraphs (Q1648665) (← links)
- Balanced allocation through random walk (Q1685024) (← links)
- A note on the localization number of random graphs: diameter two case (Q1720315) (← links)
- Constraining the clustering transition for colorings of sparse random graphs (Q1753047) (← links)
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
- On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
- Edge disjoint spanning trees in random graphs (Q1814020) (← links)
- Large induced trees in sparse random graphs (Q1821799) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- Complexity of a 3-dimensional assignment problem (Q1837625) (← 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)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Hamilton cycles in random subgraphs of pseudo-random graphs (Q1849919) (← links)
- Multicoloured Hamilton cycles (Q1890827) (← links)
- Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold (Q1899825) (← links)
