English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Low Diameter Graph Decompositions by Approximate Distance Computation

MPS-Authors
/persons/resource/persons123371

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

External Resource

https://drops.dagstuhl.de/opus/volltexte/2020/11735/
(Publisher version)

https://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

Becker, R., Emek, Y., & Lenzen, C. (2020). Low Diameter Graph Decompositions by Approximate Distance Computation. In T. Vidick (Ed.), 11th Innovations in Theoretical Computer Science Conference. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ITCS.2020.50.


Cite as: https://hdl.handle.net/21.11116/0000-0005-A7A7-2
Abstract
There is no abstract available