×

Found 7 Documents (Results 1–7)

Fault-tolerant distance labeling for planar graphs. (English) Zbl 07495147

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 315-333 (2021).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved bounds for shortest paths in dense distance graphs. (English) Zbl 1499.68270

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 61, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

Main Field

Software