Realizing degree sequences in parallel

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 2, 1996, Pages 317-338

  Arikati, Srinivasa R ^a   Maheshwari, Anil ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Degree quence; Design and analysis of algorithms; Graph algorithms; Majorization; Parallel computation; PRAM

Indexed keywords

GRAPH THEORY;

ALGORITHM ANALYSIS; PARALLEL COMPUTATION;

ALGORITHMS;

EID: 0030376459     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194267932     Document Type: Article

References (27)

1. A. AHO, J. HOPCROFT, AND J. ULLMAN, Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974, Exercises, pp. 71-72.
2. S. R. ARIKATI, New Results in Algorithmic Graph Theory, Ph.D. thesis, Department of Mathematics, University of Illinois, Chicago, 1993.
3. S. R. ARIKATI AND U. N. PELED, Degree sequences and majortzation, Linear Algebra Appl., 199 (1994), pp. 179-211.
4. T. ASANO, Graphical degree sequence problems with connectivity requirements, Lecture Notes in Computer Science 762, Springer-Verlag, New York, Berlin, 1993, pp. 38-47.
5. B. AWERBUCH, A, ISRAELI, AND Y. SHILOACH, Finding Euler circuits in logarithmic parallel time, in Proc. ACM Symposium on Theory of Computing, ACM Press, New York, 1984, pp. 249-257.
6. C. BERGE, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
7. F.T. BOESCH, ED., Large-Scale Networks: Theory and Design, IEEE Press, New York, 1976.
8. R. COLE, Parallel merge sort, SIAM J. Comput., 17 (1988), pp. 770-785.
9. A. DESSMARK, A. LINGAS, AND O. GARRIDO, On the parallel complexity of maximum f-matching and the degree sequence problem, Lecture Notes in Computer Science 841, Springer-Verlag, New York, Berlin, 1994, pp. 316-325.
10. P. ERDOS AND T. GALLAI, Graphs with prescribed degrees of vertices, Mat. Lapok, II (1960), pp. 264-272. (In Hungarian.)
11. L. R. FORD, JR. AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
12. D. R. FULKERSON, A. J. HOFFMAN, AND M. H. MCANDREW, Some properties of graphs with multiple edges, Canad. J. Math., 17 (1965), pp. 166-177.
13. D. GALE, A theorem on flows in networks, Pacific J. Math., 7 (1957), pp. 1073-1082.
14. T. HAGERUP AND C. RÜB, Optimal merging and sorting on the EREW PRAM, Infor. Proc. Letters, 33 (1989), pp. 181-185.
15. F. HARARY, Graph Theory, Addison-Wesley, New York, 1969.
16. G. H. HARDY, J. E. LITTLEWOOD, AND G. PÓLYA, Inequalities, Cambridge University Press, New York, 1952.
17. A. ISRAELI AND Y. SHILOACH, An improved parallel algorithm for maximal matching, Inform. Process. Lett., 22 (1986), pp. 57-60.
18. J. JÁJÁ, An Introduction to Parallel Algorithms, Addison-Wesley, New York, 1992.
19. R. M. KARP AND V. RAMACHANDRAN, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 869-942.
20. R. M. KARP, E. UPFAL, AND A. WIGDERSON, Constructing a maximum matching in random NC, Combinatorica, 6 (1986), pp. 35-48.
21. L. LOVÁSZ AND M. PLUMMER, Matching Theory, Academic Press, Budapest, Hungary, 1986.
22. A. W. MARSHALL AND I. OLKIN, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
23. U. N. PELED AND M. K. SRINIVASAN, The polytope of degree sequences, Linear Algebra Appl., 114 (1989), pp. 349-377.
24. H. J. RYSER, Combinatorial properties of matrices of zeros and ones, Canad. J. Math., 9 (1957), pp. 371-377.
25. G. SIERKSMA AND H. HOOGEVEEN, Seven criteria for integer sequences being graphic, J. Graph Theory, 15 (1991), pp. 223-231.
26. R. I. TYSHKEVICH, A. A. CHERNYAK, AND ZH. A. CHERNYAK, Graphs and degree sequences I, Cybernetics, 23 (1987), pp. 734-745.
27. J. VAN LEEUWEN, Graph algorithms, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 525-631.