Abstract
The field of random graphs contains many surprising and interesting results. Here we demonstrate how some of these results can be used to develop stimulating, open-ended exercises for courses in algorithms and data structures or graph theory. Specifically, we provide problems for algorithms that compute minimum spanning trees, connected components, maximum flows, and all-pairs shortest paths.
- [1] M. Atjai, J. Komlós, and E. Szemedrédi. Largest Random Component of a k-Cube. Combinatorica. 2, 1982, 1-7.Google Scholar
- [2] B. Bollobás. Random Graphs. Academic Press, 1985.Google Scholar
- [3] B. Bollobás, Y. Kohayakawa, and T. Luczak. The Evolution of Random Subgraphs of the Cube. Random Structures and Algorithms. 3, 1992, 55-90.Google Scholar
Digital Library
- [4] B. Bollobás, Y. Kohayakawa, and T. Luczak. On the Diameter and Radius of Random Subgraphs of the Cube. Random Structures and Algorithms. 5, 1994, 627-648.Google Scholar
Cross Ref
- [5] T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1992. Google Scholar
Digital Library
- [6] A. Frieze. On the Value of a Random Minimum Spanning Tree Problem. Discrete Applied Math. 10, 1985, 47-56.Google Scholar
Cross Ref
- [7] B. Hajek. Asymptotic Analysis of an Assignment Problem Arising in a Distributed Communications Protocol. Proceedings of the 27th Conference on Decision and Control. 1988, 1455-1459.Google Scholar
Cross Ref
- [8] A.V. Kostochka, A.A. Sapozhenko, and K. Weber. Radius and Diameter of Random Subgraphs of the Hypercube. Random Structures and Algorithms. 4, 1993, 215-229.Google Scholar
Cross Ref
- [9] D. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992. Google Scholar
Digital Library
- [10] S. Lumetta, A. Krishnamurthy, and D. Culler. Towards Modeling the Performance of a Fast Connected Components Algorithm on Parallel Machines. Available at http://www.cs.berkeley.edu/~stevel. Conference version at http://www.supercomp.org/sc95/proceedings/465_SLUM/SC95.HTM. Google Scholar
Digital Library
- [11] R. Sedgewick. Algorithms. Addison-Wesley Publishing Co., 1988. Google Scholar
Digital Library
Index Terms
Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs
Recommendations
List Colorings of K5-Minor-Free Graphs With Special List Assignments
The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)| = min{d(v), 6} for all v∈V(G)? ...
2-Role assignments on triangulated graphs
If G is a graph, a k-role assignment is a function mapping each vertex into a role, a positive integer 1,2, ,k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same. A graph is called a triangulated ...
Channel assignment problem and relaxed 2-distant coloring of graphs
AbstractLet G be a simple graph. Suppose f is a mapping from V ( G ) to nonnegative integers. If, for any two adjacent vertices u and v of G, | f ( u ) − f ( v ) | ≥ 2, then f is called a 2-distant coloring of G. In this paper, we introduce a ...






Comments