kth.sePublications KTH
EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
University of Vienna, Vienna, Austria.
Faculty of Computer Science, University of Vienna, Vienna, Austria.
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4468-2675
2016 (English)In: Encyclopedia of Algorithms Second Edition, Springer Nature , 2016, p. 600-602Chapter in book (Other academic)
Place, publisher, year, edition, pages
Springer Nature , 2016. p. 600-602
Keywords [en]
Approximation algorithms, Data structures, Derandomization, Dynamic graph algorithms
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-368874DOI: 10.1007/978-1-4939-2864-4_565Scopus ID: 2-s2.0-105009391140OAI: oai:DiVA.org:kth-368874DiVA, id: diva2:1991164
Note

Part of ISBN 9781493928637, 9781493928644

QC 20250822

Available from: 2025-08-22 Created: 2025-08-22 Last updated: 2025-08-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Na Nongkai, Danupon

Search in DiVA

By author/editor
Na Nongkai, Danupon
By organisation
Theoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.47.0
|
WCAG
|
KTH Library
|
DiVA support
|
Register in DiVA
|
Posting your thesis
|
SwePub
|
About Open Access