Advertisement

An O(n) algorithm for realizing degree sequences

Extended abstract
  • Srinivasa Rao Arikati
  • Anil Maheshwari
Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 880)

Abstract

A sequence d = (d1, d2,..., 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.

Keywords

Parallel Algorithm Unit Transformation Search Problem Multiple Edge Degree Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S.R. Arikati and A. Maheshwari. Realizing degree sequences in parallel. To appear in 5th ISAAC'94, China.Google Scholar
  2. 2.
    S.R. Arikati and U.N. Peled. Degree sequences and majorization. Linear Algebra Appl, 199: 179–211, 1994.Google Scholar
  3. 3.
    T. Asano. Graphical degree sequence problems with connectivity requirements. 4th ISAAC'93, LNCS 762: 38–47, 1993.Google Scholar
  4. 4.
    C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.Google Scholar
  5. 5.
    F.T. Boesch (Editor). Large-Scale Networks: Theory and Design. IEEE Press, New York, 1976.Google Scholar
  6. 6.
    V. Chvátal and P.L. Hammer. Aggregation of inequalities in integer programming. Ann. Discrete Math., 1: 145–162, 1977.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.Google Scholar
  9. 9.
    P.L. Hammer, T. Ibaraki, and B. Simeone. Threshold sequences. SIAM J. Algebraic Discrete Methods, 2: 39–49, 1981.Google Scholar
  10. 10.
    F. Harary. Graph Theory. Addison-Wesley, New York, 1969.Google Scholar
  11. 11.
    J. JáJá, An Introduction to Parallel Algorithms. Addison-Wesley, New York, 1992.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    M. Koren. Extreme degree sequences of simple graphs. J. Combin. Theory Ser., B 15: 213–224, 1973.Google Scholar
  14. 14.
    L. Lovász and M. Plummer. Matching Theory. Academic Press, Budapest, Hungary, 1986.Google Scholar
  15. 15.
    A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.Google Scholar
  16. 16.
    R.I. Tyshkevich, A.A. Chernyak and Zh. A. Chernyak. Graphs and Degree Sequences I. Cybernetics, 23: 734–745, 1987.Google Scholar
  17. 17.
    J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 525–631. Elsevier, Amsterdam, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Srinivasa Rao Arikati
    • 1
  • Anil Maheshwari
    • 1
  1. 1.Max-Planck Institute für Informatik Im StadtwaldSaarbrückenGermany

Personalised recommendations