MPI-INF/SWS Research Reports 1991-2021

1. Author,Editor - 3. with BibTeX cite keys


Realizing degree sequences in parallel

Arikati, Srinivasa R. and Maheshwari, Anil

April 1994, 27 pages.

Status: available - back from printing

A sequence $d$ 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$. The graph $G$ is said to be a realization of $d$. We provide an efficient parallel algorithm to realize $d$. Before our result, it was not known if the problem of realizing $d$ is in $NC$.

  • MPI-I-94-122.pdfMPI-I-94-122.pdfMPI-I-94-122.dvi.gz
  • Attachement: MPI-I-94-122.dvi.gz (49 KBytes); MPI-I-94-122.pdf (199 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Arikati, Srinivasa R. and Maheshwari, Anil},
  TITLE = {Realizing degree sequences in parallel},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-122},
  MONTH = {April},
  YEAR = {1994},
  ISSN = {0946-011X},