Distributed Distance-r Dominating Set on Sparse High-Girth Graphs

Amiri, Saeed Akhoondian; Wiederhake, Ben

doi:10.1016/j.tcs.2022.01.001

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Distributed Distance-r Dominating Set on Sparse High-Girth Graphs

MPS-Authors

/persons/resource/persons226588

Amiri, Saeed Akhoondian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons228416

Wiederhake, Ben
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

Amiri, S. A., & Wiederhake, B. (2022). Distributed Distance-r Dominating Set on Sparse High-Girth Graphs. Theoretical Computer Science, 906, 18-31. doi:10.1016/j.tcs.2022.01.001.

Cite as: https://hdl.handle.net/21.11116/0000-000A-9DFE-8

Abstract

There is no abstract available