English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem

MPS-Authors
/persons/resource/persons123371

Lenzen,  Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons199710

Levi,  Reut
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/8006/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

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

Lenzen, C., & Levi, R. (2017). Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. In A. W. Richa (Ed.), 31st International Symposium on Distributed Computing (pp. 1-3). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.DISC.2017.57.


Cite as: https://hdl.handle.net/21.11116/0000-0000-3F28-E
Abstract
There is no abstract available