Complexity of modification problems for reciprocal best match graphs

Hellmuth, Marc; Geiß, Manuela; Stadler, Peter F.

doi:10.1016/j.tcs.2019.12.033

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Complexity of modification problems for reciprocal best match graphs

MPS-Authors

Hellmuth, Marc
Max Planck Institute for Mathematics in the Sciences, Max Planck Society;

Stadler, Peter F.
Max Planck Institute for Mathematics in the Sciences, 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

Hellmuth, M., Geiß, M., & Stadler, P. F. (2020). Complexity of modification problems for reciprocal best match graphs. Theoretical computer science, 809, 384-393. doi:10.1016/j.tcs.2019.12.033.

Cite as: https://hdl.handle.net/21.11116/0000-0008-5C11-E

Abstract

There is no abstract available