Arc-completion of 2-colored best match graphs to binary-explainable best match 
graphs

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

doi:10.3390/a14040110

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Arc-completion of 2-colored best match graphs to binary-explainable best match graphs

MPS-Authors

Schaller, David
Max Planck Institute for Mathematics in the Sciences, Max Planck Society;

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

Schaller, D., Geiß, M., Hellmuth, M., & Stadler, P. F. (2021). Arc-completion of 2-colored best match graphs to binary-explainable best match graphs. Algorithms, 14(4): 110. doi:10.3390/a14040110.

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

Abstract

There is no abstract available