Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-94-122

Realizing degree sequences in parallel

Arikati, Srinivasa R. and Maheshwari, Anil

MPI-I-94-122. April 1994, 27 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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$.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-94-122.pdfMPI-I-94-122.pdfMPI-I-94-122.dvi.gz49 KBytes; 199 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1994-122
Hide details for BibTeXBibTeX
@TECHREPORT{ArikatiMaheshwari94,
  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},
}