Strong Connectivity Augmentation is FPT

Vitting Klinkby, Kristine; Misra, Pranabendu; Saurabh, Saket

doi:10.1137/1.9781611976465.15

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Strong Connectivity Augmentation is FPT

MPS-Authors

/persons/resource/persons248282

Misra, Pranabendu
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

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

Vitting Klinkby, K., Misra, P., & Saurabh, S. (2021). Strong Connectivity Augmentation is FPT. In D. Marx (Ed.), Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (pp. 219-234). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976465.15.

Cite as: https://hdl.handle.net/21.11116/0000-0007-D2A6-0

Abstract

There is no abstract available