Abstract
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.
Cite
CITATION STYLE
APA
Arikati, S., & Maheshwari, A. (1994). Realizing degree sequences in parallel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 261–269). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_189
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free