Abstract
A sequence d = (d 1, d 2,..., d n ) of integers is a degree sequence if there exists a (simple) graph G such that the components of d are equal to the degrees of the vertices of G. We present an O(n)-time sequential algorithm to realize d, i.e., to compute the graph G. We provide an efficient parallel implementation of our algorithm.
This work is partially supported by the EEC ESPRIT Basic Research Action No. 7141 (ALCOM II).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S.R. Arikati and A. Maheshwari. Realizing degree sequences in parallel. To appear in 5th ISAAC'94, China.
S.R. Arikati and U.N. Peled. Degree sequences and majorization. Linear Algebra Appl, 199: 179–211, 1994.
T. Asano. Graphical degree sequence problems with connectivity requirements. 4th ISAAC'93, LNCS 762: 38–47, 1993.
C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.
F.T. Boesch (Editor). Large-Scale Networks: Theory and Design. IEEE Press, New York, 1976.
V. Chvátal and P.L. Hammer. Aggregation of inequalities in integer programming. Ann. Discrete Math., 1: 145–162, 1977.
A. Dessmark, A. Lingas and O. Garrido. On the parallel complexity of maximum f-matching and the degree sequence problem. To appear in MFCS'94. LNCS, Springer-Verlag, 1994.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
P.L. Hammer, T. Ibaraki, and B. Simeone. Threshold sequences. SIAM J. Algebraic Discrete Methods, 2: 39–49, 1981.
F. Harary. Graph Theory. Addison-Wesley, New York, 1969.
J. JáJá, An Introduction to Parallel Algorithms. Addison-Wesley, New York, 1992.
R.M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 869–942. Elsevier, Amsterdam, 1990.
M. Koren. Extreme degree sequences of simple graphs. J. Combin. Theory Ser., B 15: 213–224, 1973.
L. Lovász and M. Plummer. Matching Theory. Academic Press, Budapest, Hungary, 1986.
A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
R.I. Tyshkevich, A.A. Chernyak and Zh. A. Chernyak. Graphs and Degree Sequences I. Cybernetics, 23: 734–745, 1987.
J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 525–631. Elsevier, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arikati, S.R., Maheshwari, A. (1994). An O(n) algorithm for realizing degree sequences. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_119
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_119
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive