An O(n) Algorithm for Realizing Degree Sequences

Arikati, Srinivasa; Maheshwari, Anil

doi:10.1007/3-540-58715-2_119

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

An O(n) Algorithm for Realizing Degree Sequences

MPS-Authors

/persons/resource/persons44027

Arikati, Srinivasa
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44968

Maheshwari, Anil
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dufLb
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Arikati, S., & Maheshwari, A. (1994). An O(n) Algorithm for Realizing Degree Sequences. In P. S. Thiagarajan (Ed.), Foundations of Software Technology and Theoretical Computer Science (pp. 125-136). Berlin: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-149B-D

Abstract

There is no abstract available