Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Translated title of the contributionFully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
Original languageEnglish
Title of host publicationProceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT)
Number of pages13
PublisherSpringer
Publication date2004
Pages384-396
Publication statusPublished - 2004
Externally publishedYes
SeriesLecture notes in computer science
Volume3111
ISSN0302-9743

ID: 98321730