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$.
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.pdf||49 KBytes; 199 KBytes|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|